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
295
296
297
298
299
300
#include<bits/stdc++.h>
#define st first
#define nd second
#define all(x) x.begin(), x.end()
#define BOOST cin.tie(NULL); ios_base::sync_with_stdio(false);
 
#define int ll
typedef long long ll;

using namespace std;
template <typename T> struct tag:reference_wrapper <T>{ using reference_wrapper <T>::reference_wrapper; };
template <typename T1, typename T2> static inline tag <ostream> operator<<(tag <ostream> os, pair<T1, T2> const& p){ return os.get()<<"{"<<p.first<<", "<<p.second<<"}", os;}
template <typename Other> static inline tag <ostream> operator<<(tag <ostream> os, Other const& o){ os.get()<<o; return os; }
template <typename T> static inline tag <ostream> operator <<(tag <ostream> os, vector <T> const& v){ os.get()<<"["; for (int i=0; i<v.size(); i++) if (i!=v.size()-1) os.get()<<v[i]<<", "; else os.get()<<v[i]; return os.get()<<"]", os; }
template <typename T> static inline tag <ostream> operator <<(tag <ostream> os, set <T> const& s){ vector <T> v; for (auto i: s) v.push_back(i); os.get()<<"["; for (int i=0; i<v.size(); i++) if (i!=v.size()-1) os.get()<<v[i]<<", "; else os.get()<<v[i]; return os.get()<<"]", os; }

struct Node{
    long long p;    // product
    long long s;    // smallest combination
    long long b;    // biggest combination
    long long noc;  // number of combinations without restrictions
    int ep;   // end point 
    vector<int> d;  // digits
};

vector<int> dig;
vector<int> primes = {2,3,5,7};

int limn = 18;
long long lim = 1e18;
vector<int> d(10, 0);

long long global_ctr = 0;
vector<vector<Node>> spis;
vector<int> spisctr;
vector<vector<long long>> prefans;

long long pascal[20][20];

void count_newt(int n){
    for(int i = 0; i <= n; i++){
        pascal[i][0] = 1;
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= i; j++){
            pascal[i][j] = pascal[i - 1][j - 1] + pascal[i - 1][j];
        }
    }
}

long long newt(int n, int k){
    return pascal[n][k];
}

long long reverse(long long x){
    long long ans = 0;
    while(x){
        ans *= 10;
        ans += (x%10);
        x/= 10;
    }
    return ans;
}

bool spis_cmp(Node a, Node b){
    // assert(a.s != b.s);
    return a.s < b.s;
}


long long smallest_comb(){
    long long ans = 0;
    int ctr;
    for(int i = 1; i <= 9; i++){
        ctr = 0;
        while(ctr < d[i]){
            ans *= 10;
            ans += i;
            ctr++;
        }
    }
    return ans;
}

long long biggest_comb(){
    long long ans = 0;
    int ctr;
    for(int i = 9; i >= 1; i--){
        ctr = 0;
        while(ctr < d[i]){
            ans *= 10;
            ans += i;
            ctr++;
        }
    }
    return ans;
}

long long number_of_combinations(vector<int> &digs){
    long long ans = 1;
    int dl = digs[1];
    for(int i = 2; i <= 9; i++){
        dl += digs[i];
        ans *= newt(dl, digs[i]);
    }
    return ans;
}

long long number_of_combinations_smaller_than_n(long long n, vector<int> digs){
    long long rn = reverse(n);
    long long ans = 0;
    int ld;
    while(rn){
        ld = rn % 10;
        for(int i = 1; i < ld; i++){
            if(digs[i]){
                digs[i]--;
                ans += number_of_combinations(digs);
                digs[i]++;
            }
        }
        if(digs[ld] == 0) break;
        digs[ld]--;
        rn /= 10;
    }
    if(rn == 0) ans++;
    return ans;
}

long long prod(long long x){
    long long ans = 1;
    while(x){
        ans *= (x % 10);
        x /= 10;
    }
    return ans;
}

int find_end_point(long long x){
    while(x >= 10){
        x = prod(x);
    }
    return x;
}

void hms(long long x){
    d[5] = dig[2];
    d[7] = dig[3];
    int sum, limf1, ep = find_end_point(x);
    if(ep == 0) return;
    for(int i8 = 0; i8 <= dig[0]/3; i8++){
        d[8] = i8;
        for(int i4 = 0; i4 <= (dig[0] - 3 * i8)/2; i4++){
            d[4] = i4;
            for(int i9 = 0; i9 <= dig[1]/2; i9++){
                d[9] = i9;
                for(int i6 = 0; i6 <= min(dig[0] - 3 * i8 - 2 * i4, dig[1] - i9 * 2); i6++){
                    d[2] = dig[0] - 3 * i8 - 2 * i4 - i6;
                    d[3] = dig[1] - 2 * i9 - i6;
                    d[6] = i6;
                    sum = 0;
                    for(int i = 2; i <= 9; i++){
                        sum += d[i];
                    }
                    if(sum > limn) continue;
                    limf1 = limn - sum;
                    for(int i1 = 0; i1 <= limf1; i1++, sum++){
                        d[1] = i1;
                        spis[sum][spisctr[sum]++] = {x, smallest_comb(), biggest_comb(), number_of_combinations(d), ep, d};
                    }
                }
            }
        }
    }
}

void gen(int dc, int ld, long long wyn){
    // cout << dc << " " << ld << " " << wyn << "\n";
    // if(wyn > n) return;
    // cout << wyn << ": " << dig << "\n";
    if(dc > 18) return;
    if(dc == 18 || ld == 4){
        // secsta.push_back(wyn);
        hms(wyn);
        if(dc == 18 && (dig[0] % 3) == 1 && (dig[1] % 2) == 0){
            // secsta.push_back(wyn * 3);
            dig[1]++;
            hms(wyn * 3);
            dig[1]--;
        }
        return;
    }
    int tmp;
    gen(dc, ld + 1, wyn);
    if(ld == 2 && dig[0] > 0){
        dig[ld] = 0;
        return;
    }
    while(wyn * primes[ld] <= lim && dc < 19){
        tmp = 1;

        if((ld == 0 && (dig[ld] % 3) != 0) || (ld == 1 && (dig[ld] % 2) != 0)) tmp = 0;
        
        wyn *= primes[ld];
        dig[ld]++;
        dc += tmp;
        gen(dc, ld + 1, wyn);

        // if(ld == 1 && (dig[0] % 3) == 1){
        //     dig[ld]++;
        //     gen(dc, ld + 1, wyn * 3);
        // }
    }
    dig[ld] = 0;
}

void solve(){
    long long n; cin >> n;
    vector<long long> ans(10, 0);
    for(int i = 1; i < spis.size() - 1; i++){
        // cout << "i:  " << i << "\n";
        if(spis[i].back().b <= n){
            for(int j = 0; j <= 9; j++){
                ans[j] += prefans[i][j];
            }
            // cout << "a: " << ans << "\n";
            continue;
        }
        if(spis[i][0].s > n){
            break;
        }

        for(auto node : spis[i]){
            if(node.ep == 0) continue;
            // cout << "       [ p: " << node.p << "  s: " << node.s << "  b: " << node.b << " noc: " << node.noc << "  ep: " << node.ep << "  d: " << node.d << " ]\n";
            ans[node.ep] += number_of_combinations_smaller_than_n(n, node.d);
            // cout << "a: " << ans << "\n";
        }
    }

    ans[0] = n;
    for(int i = 1; i <= 9; i++){
        ans[0] -= ans[i];
    }
    for(int i = 0; i <= 9; i++){
        cout << ans[i] << " ";
    }
    cout << "\n";
}



int32_t main(){
    BOOST;

    count_newt(19);
    prefans.assign(20, vector<int>(10, 0));
    spis.resize(20);
    spisctr.assign(20, 0);

    spis[0].resize(1);
    spis[1].resize(9);
    spis[2].resize(37);
    spis[3].resize(105);
    spis[4].resize(218);
    spis[5].resize(362);
    spis[6].resize(590);
    spis[7].resize(931);
    spis[8].resize(1382);
    spis[9].resize(1921);
    spis[10].resize(2470);
    spis[11].resize(3028);
    spis[12].resize(3608);
    spis[13].resize(4208);
    spis[14].resize(4804);
    spis[15].resize(5372);
    spis[16].resize(5914);
    spis[17].resize(6436);
    spis[18].resize(6972);

    dig.assign(4, 0);

    gen(0, 0, 1);

    int tmp = 0;
    for(int i = 0; i < spis.size(); i++){
        sort(all(spis[i]), spis_cmp);
        tmp = spis[i].size();
        for(Node node : spis[i]){
            prefans[i][node.ep] += node.noc;
        }
    }

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

    return 0;
}