1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
#include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define fr(i,n) for(int i=0; i<(n); i++)
#define frx(i,a,b) for(int i=(a); i<=(b); i++)
#define ok(cond) cout << ((cond) ? "Yes" : "No") << "\n";
#define watch(x) cerr << (#x) << " == " << (x) << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef const int ci;
typedef const ll cll;
typedef const ld cld;
typedef pair<int,int> pii;
typedef set<int> si;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
typedef vector<pair<int,ll>> vpill;


template<typename T1, typename T2>
istream& operator>>(istream& is, pair<T1,T2>& p) {
    return is >> p.st >> p.nd;
}

template<typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1,T2>& p) {
    return os << p.st << " " << p.nd;
}


template<typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
    for (T x : v) {
        os << x << " ";
    }
    return os;
}

template<typename T>
ostream& operator<<(ostream& os, set<T>& s) {
    for (T x : s) {
        os << x << " ";
    }
    return os;
}

int num_len = 9;
int cnt[9];
int even_count = 0, five_count = 0;

const int MAX_NONZERO = 25*1e6;
int iter = 0;
vector<int> nums;
// int nums[MAX_NONZERO];
int counts[9][MAX_NONZERO];

inline int mult_digits(int x) {
    while (x > 9) {
        int ans = 1;
        while (ans && x) {
            ans *= x % 10;
            x /= 10;
        }
        x = ans;
    }
    return x;
}

void num_dfs(int len, int num) {
    if (len < num_len) {
        frx(i,1,9) {
            bool even = (i % 2 == 0);
            bool five = (i == 5);
            if ((even || even_count) && (five || five_count)) {
                continue;
            }
            even_count += even;
            five_count += five;
            num_dfs(len + 1, num * 10 + i);
            even_count -= even;
            five_count -= five;
        }
    } else {
        int m = mult_digits(num);
        if (m != 0) {
            cnt[m-1]++;
            nums.pb(num);
            // nums[iter] = num;
            fr(i,9) {
                counts[i][iter] = cnt[i];
            }
            iter++;
        }
    }
}

const int T = 1000;
ll queries[T+5];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t;
    cin>>t;
    ll max_query = 0;
    fr(i,t) {
        cin>>queries[i];
        max_query = max(max_query, queries[i]);
    }

    int max_len = 0;
    while (max_query) {
        max_query /= 10;
        max_len++;
    }

    frx(len, 1, max_len) {
        num_len = len;
        num_dfs(0, 0);
    }

    fr(i,t) {
        auto it = ub(nums.begin(), nums.end(), queries[i]);
        it--;
        int cnt_iter = it - nums.begin();
        int zeros = queries[i];
        fr(j,9) {
            zeros -= counts[j][cnt_iter];
        }
        cout << zeros << " ";
        fr(j,9) {
            cout << counts[j][cnt_iter] << " ";
        }
        cout << "\n";
    }

    return 0;
}