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
#include <bits/stdc++.h>
using namespace std;
#define rep(a, b) for (int a = 0; a < (b); a++)
#define rep1(a, b) for (int a = 1; a <= (b); a++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;
const ll MAX = 1'000'000'000'000'000'000;

#define LOCAL false


ll fact[20];

ll f(ll x) {
    if (x < 10) return x;
    ll prod = 1;
    while (x) {
        prod *= x%10;
        x /= 10;
    }
    return f(prod);
}

using Expo = vector<int>; // 4-elementowy !
using Digset = vector<int>; // 10-elementowy !
vector<Expo> generators[10];
vector<Digset> digsets[10][200];

Expo factor[10] = {
    {0, 0, 0, 0},
    {0, 0, 0, 0},
    {1, 0, 0, 0},
    {0, 1, 0, 0},
    {2, 0, 0, 0},
    {0, 0, 1, 0},
    {1, 1, 0, 0},
    {0, 0, 0, 1},
    {3, 0, 0, 0},
    {0, 2, 0, 0}
};

Expo curex;
Digset curdig;
vector<Digset>* bag;
int gendigcnt = 0;
void go(int d) {
    if (!(curex[0]||curex[1]||curex[2]||curex[3]) && gendigcnt <= 18) {
        bag->push_back(curdig);
        return;
    }
    for (int d2 = d; d2 <= 9; d2++) {
        rep(i, 4) curex[i] -= factor[d2][i];
        curdig[d2]++;
        gendigcnt++;
        if (curex[0]>=0 && curex[1]>=0 && curex[2]>=0 && curex[3]>=0) go(d2);
        rep(i, 4) curex[i] += factor[d2][i];
        curdig[d2]--;
        gendigcnt--;
    }
}

int ans1(ll n) {
    ll cur = 1;
    int cnt = 1;
    while (cur <= n) {
        cur *= 10;
        cur++;
        cnt++;
    }
    return cnt-1;
}

ll n;
ll ans[10];
void solve() {
    cin >> n;

    vector<int> ndigits;
    ll n2 = n;
    while (n2) {
        ndigits.push_back(n2%10);
        n2 /= 10;
    }
    reverse(all(ndigits));

    int nlen = ndigits.size();
    rep1(i, 9) rep(j, generators[i].size()) rep(k, digsets[i][j].size()) {
        Digset digs = digsets[i][j][k];
        int len2 = accumulate(all(digs), 0);
        if (len2 > nlen) continue;
        ll denom = 1;
        rep1(d2, 9) denom *= fact[digs[d2]];
        rep(ii, nlen-len2) {
            ans[i] += fact[len2+ii]/denom;
            digs[1]++;
            denom *= digs[1];
        }
        rep(dpos, nlen) {
            int d = ndigits[dpos];
            int lesscnt = accumulate(begin(digs), begin(digs)+d, 0);
            ans[i] += fact[nlen-dpos-1]*lesscnt/denom;
            if (digs[d]>0) {
                denom /= digs[d];
                digs[d]--;
                if (dpos == nlen-1) ans[i]++;
            } else break;
        }
    }
    ans[1] = ans1(n);
    ans[0] = n;
    rep1(i, 9) ans[0] -= ans[i];

    rep(i, 10) cout << ans[i] << " ";
    cout << "\n";
    rep(i, 10) ans[i] = 0;
}


int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    if (LOCAL) {
        ignore=freopen("io/in", "r", stdin);
        ignore=freopen("io/out", "w", stdout);
    }

    fact[0] = 1;
    rep1(i, 19) fact[i] = i*fact[i-1];

    vector<ll> nums;

    ll prod1 = 1;
    int p1=0, p2=0, p3=0, p4=0;
    while (prod1 <= MAX) {
        ll prod2 = prod1;
        while (prod2 <= MAX) {
            ll prod3 = prod2;
            while (prod3 <= MAX) {
                ll prod4 = prod3;
                while (prod4 <= MAX) {
                    int fval = f(prod4);
                    if (fval != 0 && (p1||p2||p3||p4)) generators[fval].push_back({p1, p2, p3, p4});
                    prod4 *= 7;
                    p4++;
                }
                p4 = 0;
                prod3 *= 5;
                p3++;
            }
            p3 = 0;
            prod2 *= 3;
            p2++;
        }
        p2 = 0;
        prod1 *= 2;
        p1++;
    }
    p1 = 0;

    rep1(i, 9) rep(j, generators[i].size()) {
        bag = &digsets[i][j];
        curex = generators[i][j];
        curdig = Digset(10, 0);
        go(2);
    }

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

    return 0;
}