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
#ifndef LOCAL
#pragma GCC optimize("O3,unroll-loops")
#endif
#include <bits/stdc++.h>
#define fi first
#define se second
#define pn printf("\n")
#define ssize(x) int(x.size())
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define bitcount(x) __builtin_popcount(x)
#define clz(x) __builtin_clz(x)
#define ctz(x) __builtin_ctz(x)
//~ #define r(x) resize(x)
//~ #define rf(x, c) resize(x, c)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef double db;
typedef long double ldb;
#define V vector
int inf = 2e09; ll infll = 2e18; int mod = (1<<23)*119+1;
void answer(){
    function<ll(ll)> reduce = [&](ll x){
        if(x < 10) return x;
        ll y = 1;
        while(x)
            y *= x%10, x /= 10;
        return reduce(y);
    };
    ll N = 1e18;
    V<ll> t;
    for(ll a = 1; a <= N; a *= 2)
        for(ll b = 1; a*b <= N; b *= 3)
            for(ll c = 1; a*b*c <= N; c *= 5)
                for(ll d = 1; a*b*c*d <= N; d *= 7) if(reduce(a*b*c*d))
                    t.emplace_back(a*b*c*d);
    sort(all(t));
    V<tuple<ll, V<V<int>>>> d_list;
    for(ll u : t){
        V<V<int>> d;
        queue<pair<ll, V<int>>> q;
        q.emplace(make_pair(u, V<int>()));
        while(ssize(q)){
            ll x = q.front().fi;
            V<int> nr = q.front().se;
            q.pop();
            if(ssize(nr) > 19)
                continue;
            if(x == 1){
                d.emplace_back(nr);
                continue;
            }
            for(int i = ssize(nr) ? nr.back() : 9; i >= 2; --i)
                if(!(x % i)){
                    nr.emplace_back(i);
                    q.emplace(make_pair(x/i, nr));
                    nr.pop_back();
                }
        }
        d_list.emplace_back(make_tuple(u, d));
    }

    V<ll> fac(20, 1);
    for(int i = 1; i <= 19; ++i)
        fac[i] = fac[i-1]*i;

    V<tuple<ll, int, V<int>>> info; // pary {x, len, digits}

    auto get_count = [&](int I, V<int> &d_cnt){ // tutaj bedzie funkcja tylko do tych o rownej dlugosci
        int digit_count = 0;
        for(int u : d_cnt)
            digit_count += u;
        
        auto &[x, len, digits] = info[I];
        
        if(len < digit_count)
            return 0ll;
        while(digit_count < len)
            ++digit_count, ++d_cnt[1];

        ll result = 0, curr = fac[len];
        for(int i = 1; i < 10; ++i)
            curr /= fac[d_cnt[i]];
        
        bool br = 0;
        for(int i = 0; i < len; ++i){
            for(int j = 1; j < digits[i]; ++j) 
                if(d_cnt[j]) // ubywa nam ten koleś wiec go usuwamy z mianownika
                    result += curr*d_cnt[j]/(len-i);
            if(!d_cnt[digits[i]]){
                br = 1;
                break;
            }
            curr *= d_cnt[digits[i]];
            d_cnt[digits[i]]--;
            curr /= len-i; // od silni w mianowniku to zabieramy, dopiero tu bo nie mamy doubli
            
        }
        // brak br to case, gdzie nasz multizbior liczb matchuje sie idealnie z liczbą z zapytania
        return result + (!br);
    };

    int n; scanf("%d", &n);
    V<ll> q_list(n);
    V<V<ll>> result(n, V<ll>(10, 0));
    for(int i = 0; i < n; ++i)
        scanf("%lld", &q_list[i]);

    for(int i = 0; i < n; ++i){
        ll tmp = q_list[i];
        V<int> digits;
        int len = 0;
        while(tmp)
            ++len, digits.emplace_back(tmp%10), tmp /= 10;
        reverse(all(digits));
        info.emplace_back(make_tuple(q_list[i], len, digits));
    }

    V<ll> res_pf(20, 0);
    V<int> d_cnt(10, 0), d_cnt2(10, 0);
    for(auto &[val, d] : d_list){
        ll digit = reduce(val);
        for(V<int> &v : d){
            fill(all(res_pf), 0);
            fill(all(d_cnt), 0);
            res_pf[ssize(v)] = fac[ssize(v)];
            
            for(int u : v)
                ++d_cnt[u];
            for(int i = 1; i < 10; ++i)
                res_pf[ssize(v)] /= fac[d_cnt[i]];
            
            for(int i = ssize(v)+1; i < 20; ++i) // dostawiamy jedynki
                res_pf[i] = res_pf[i-1]*i/(i-ssize(v));
            
            res_pf[0] = 0;
            for(int i = 1; i < 20; ++i)
                res_pf[i] += res_pf[i-1];
            
            for(int i = 0; i < n; ++i){
                ll x = q_list[i];
                int len = get<1>(info[i]);
                d_cnt2 = d_cnt;
                result[i][digit] += res_pf[len-1];
                result[i][digit] += get_count(i, d_cnt2);
            }
        }
    }
    
    for(int i = 0; i < n; ++i){
        ll x = q_list[i], sum = 0;
        for(int j = 1; j < 10; ++j) sum += result[i][j];
        result[i][0] = x-sum;
        for(ll &u : result[i])
            printf("%lld ", u);
        pn;
    }
}
int main(){
		int T = 1;
		// scanf("%d", &T);
		//~ ios_base::sync_with_stdio(0); cin.tie(0); cin >> T;
		for(++T; --T; ) answer();
		return 0;
}