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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
// clang-format off
#include <bits/stdc++.h>

using namespace std;

#define ALL(x) (x).begin(), (x).end()

template<class C> void mini(C &a5, C b5) { a5 = min(a5, b5); }
template<class C> void maxi(C &a5, C b5) { a5 = max(a5, b5); }

#ifdef LOCAL
const bool debug = true;
#else
const bool debug = false;
#define cerr if (true) {} else cout
#endif
// clang-format on

#define int long long
#define double long double

const int INF = 1e18;
const int mod = 1e9 + 7;
const int dax = 18;

int pot[11][100];
void init_pot() {
    for (int i = 0; i < 11; i++) {
        pot[i][0] = 1;
        for (int j = 1; j < 100; j++)
            pot[i][j] = pot[i][j - 1] * i;
    }
}

// n2, n3, n5, n7
int product[3 * dax + 1][2 * dax + 1][dax + 1][dax + 1];
void init_product() {
    for (int n2 = 0; n2 <= 3 * dax; n2++)
        for (int n3 = 0; n3 <= 2 * dax; n3++)
            for (int n5 = 0; n5 <= dax; n5++)
                for (int n7 = 0; n7 <= dax; n7++)
                    product[n2][n3][n5][n7] =
                        pot[2][n2] * pot[3][n3] * pot[5][n5] * pot[7][n7];
}

int foo[3 * dax + 1][2 * dax + 1][dax + 1][dax + 1];
int foo_(int x) {
    if (x < 10)
        return x;

    int y = 1;
    while (x) {
        y *= x % 10;
        x /= 10;
    }
    return foo_(y);
}
void init_foo() {
    for (int n2 = 0; n2 <= 3 * dax; n2++)
        for (int n3 = 0; n3 <= 2 * dax; n3++)
            for (int n5 = 0; n5 <= dax; n5++)
                for (int n7 = 0; n7 <= dax; n7++)
                    foo[n2][n3][n5][n7] = foo_(product[n2][n3][n5][n7]);
}

int dwumian[dax + 1][dax + 1];

void init_dwumian() {
    for (int i = 0; i <= dax; i++) {
        dwumian[i][0] = 1;
        dwumian[i][i] = 1;
    }

    for (int i = 1; i <= dax; i++) {
        for (int j = 1; j < i; j++) {
            dwumian[i][j] = dwumian[i - 1][j - 1] + dwumian[i - 1][j];
        }
    }
}

// n_digits, n2, n3, n5, n7
int simple[dax + 1][3 * dax + 1][2 * dax + 1][dax + 1][dax + 1];

inline int calc_simple(int n_digits, int n2, int n3, int n5, int n7) {
    if (n5 + n7 > n_digits)
        return 0;

    int res = 1;
    res *= dwumian[n_digits][n7];
    n_digits -= n7;
    res *= dwumian[n_digits][n5];
    n_digits -= n5;

    if (n2 + n3 == 0) {
        return res;
    }
    if (n_digits == 0) {
        return 0;
    }

    int res2 = 0;

    // 1
    res2 += simple[n_digits - 1][n2][n3][0][0];

    // 2
    if (n2 >= 1)
        res2 += simple[n_digits - 1][n2 - 1][n3][0][0];

    // 4
    if (n2 >= 2)
        res2 += simple[n_digits - 1][n2 - 2][n3][0][0];

    // 8
    if (n2 >= 3)
        res2 += simple[n_digits - 1][n2 - 3][n3][0][0];

    // 3
    if (n3 >= 1)
        res2 += simple[n_digits - 1][n2][n3 - 1][0][0];

    // 9
    if (n3 >= 2)
        res2 += simple[n_digits - 1][n2][n3 - 2][0][0];

    // 6
    if (n3 >= 1 && n2 >= 1)
        res2 += simple[n_digits - 1][n2 - 1][n3 - 1][0][0];

    return res * res2;
}

void init_simple() {
    for (int n_digits = 0; n_digits <= dax; n_digits++)
        for (int n2 = 0; n2 <= 3 * dax; n2++)
            for (int n3 = 0; n3 <= 2 * dax; n3++)
                for (int n5 = 0; n5 <= dax; n5++)
                    for (int n7 = 0; n7 <= dax; n7++)
                        simple[n_digits][n2][n3][n5][n7] =
                            calc_simple(n_digits, n2, n3, n5, n7);
}

int hard(int x, int n_digits, int n2, int n3, int n5, int n7) {
    if (x < 0)
        return 0;
    if (x >= pot[10][n_digits] - 1)
        return simple[n_digits][n2][n3][n5][n7];

    int res = 0;
    int pot_ = pot[10][n_digits - 1];

    // 1
    res += hard(x - 1 * pot_, n_digits - 1, n2, n3, n5, n7);

    // 2
    if (n2 >= 1)
        res += hard(x - 2 * pot_, n_digits - 1, n2 - 1, n3, n5, n7);

    // 4
    if (n2 >= 2)
        res += hard(x - 4 * pot_, n_digits - 1, n2 - 2, n3, n5, n7);

    // 8
    if (n2 >= 3)
        res += hard(x - 8 * pot_, n_digits - 1, n2 - 3, n3, n5, n7);

    // 3
    if (n3 >= 1)
        res += hard(x - 3 * pot_, n_digits - 1, n2, n3 - 1, n5, n7);

    // 9
    if (n3 >= 2)
        res += hard(x - 9 * pot_, n_digits - 1, n2, n3 - 2, n5, n7);

    // 6
    if (n3 >= 1 && n2 >= 1)
        res += hard(x - 6 * pot_, n_digits - 1, n2 - 1, n3 - 1, n5, n7);

    // 5
    if (n5 >= 1)
        res += hard(x - 5 * pot_, n_digits - 1, n2, n3, n5 - 1, n7);

    // 7
    if (n7 >= 1)
        res += hard(x - 7 * pot_, n_digits - 1, n2, n3, n5, n7 - 1);

    return res;
}

bool should_brake(int n_digits, int n2 = 0, int n3 = 0, int n5 = 0,
                  int n7 = 0) {
    return n2 / 3 + n3 / 2 + n5 + n7 > n_digits;
}

void solve() {
    bool is_max_test = false;

    int n;
    cin >> n;
    if (n == pot[10][18]) {
        is_max_test = true;
        n--;
    }

    int n_digits = 0;
    int n_ = n;
    while (n_) {
        n_digits++;
        n_ /= 10;
    }

    int res[10] = {0};
    for (int i = 0; i < 10; i++)
        res[i] = 0;

    for (int n2 = 0; n2 <= 3 * dax; n2++) {
        if (should_brake(n_digits, n2))
            break;
        for (int n3 = 0; n3 <= 2 * dax; n3++) {
            if (should_brake(n_digits, n2, n3))
                break;
            for (int n5 = 0; n5 <= 0; n5++) {
                if (should_brake(n_digits, n2, n3, n5))
                    break;
                for (int n7 = 0; n7 <= dax; n7++) {
                    if (should_brake(n_digits, n2, n3, n5, n7))
                        break;
                    if (foo[n2][n3][n5][n7] == 0)
                        continue;
                    int x = hard(n, n_digits, n2, n3, n5, n7);
                    for (int i = 1; i < n_digits; i++)
                        x += simple[i][n2][n3][n5][n7];
                    res[foo[n2][n3][n5][n7]] += x;
                }
            }
        }
    }

    for (int n2 = 0; n2 <= 0; n2++) {
        if (should_brake(n_digits, n2))
            break;
        for (int n3 = 0; n3 <= 2 * dax; n3++) {
            if (should_brake(n_digits, n2, n3))
                break;
            for (int n5 = 1; n5 <= dax; n5++) {
                if (should_brake(n_digits, n2, n3, n5))
                    break;
                for (int n7 = 0; n7 <= dax; n7++) {
                    if (should_brake(n_digits, n2, n3, n5, n7))
                        break;
                    if (foo[n2][n3][n5][n7] == 0)
                        continue;
                    int x = hard(n, n_digits, n2, n3, n5, n7);
                    for (int i = 1; i < n_digits; i++)
                        x += simple[i][n2][n3][n5][n7];
                    res[foo[n2][n3][n5][n7]] += x;
                }
            }
        }
    }

    res[0] = n + is_max_test;
    for (int i = 1; i < 10; i++)
        res[0] -= res[i];
    for (int i = 0; i < 10; i++)
        cout << res[i] << " ";
    cout << endl;
}

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

    init_pot();
    init_dwumian();
    init_product();
    init_foo();
    init_simple();

    // cout << simple[1][0][2][0][0] << endl;
    // hard(10, 2, 0, 1, 0, 0);
    // return 0;

    int t;
    cin >> t;
    while (t--) {
        solve();
        // break;
    }

    return 0;
} /*

 */