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
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for (int i = (a); i <= (b); ++i)
#define REPD(i,a,b) for (int i = (a); i >= (b); --i)
#define FORI(i,n) REP(i,1,n)
#define FOR(i,n) REP(i,0,int(n)-1)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define ll long long
#define SZ(x) int((x).size())
#define DBG(v) cerr << #v << " = " << (v) << endl;
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define fi first
#define se second

int total[33];
vector<vi> digits[33];
vector<int> fin_dig[33];
vector<ll> n_full[33];
map<ll,int> dig;
ll fact[33];

const int D = 18;
vi pref;

ll n;
string sn;
int dn;
ll ans[11];
ll ans_d[33][11];

int get_dig(ll x) {
	if (x < 10) return x;
	if (dig.find(x) != dig.end()) return dig[x];
	ll x0 = x, mul = 1;
	while (x>0) {
		mul *= x % 10;
		x /= 10;
	}
	return dig[x0] = get_dig(mul);
}

ll n_comb(vi p) {
	int cnt = 0;
	ll den = 1;
	FORI(i,9) {
		cnt += p[i];
		den *= fact[p[i]];
	}
	return fact[cnt] / den;
}

void test() {
	scanf("%lld", &n);
	FOR(i,10) ans[i]=0;
	ans[0] = n;
	if (n==1000000000000000000LL) n--;
	sn = to_string(n);
	dn = SZ(sn);
	FORI(j,9) ans[j] = ans_d[dn-1][j];
	
	FOR(i,total[dn]) {
		vi p = digits[dn][i];
		int td = dn;
		ll n_c = n_full[dn][i];
		FOR(k,dn) {
			int c = sn[k]-'0';
			FOR(d,c) if (p[d]>0) {
				ll mul = n_c * p[d] / td;
				p[d]--;
				//ll mul = n_comb(p);
				ans[fin_dig[dn][i]] += mul;
				p[d]++;
			}
			if (p[c]==0) break;
			n_c = n_c * p[c] / td;
			p[c]--;
			td--;
		}
	}
	int ddn = get_dig(n);
	if (ddn != 0) ans[ddn]++;
	
	FORI(i,9) ans[0] -= ans[i];
	FOR(i,10) printf("%lld ", ans[i]);
	printf("\n");
}

int get_dig_v(vi p) {
	ll mul = 1;
	FOR(i,SZ(p)) {
		FOR(j,p[i]) mul *= i;
	}
	return get_dig(mul);
}

void rec(int rem, int pos) {
	if (pos>5 && pref[5]>0) {
		if (pref[2]>0 || pref[4]>0) return;
		if (pos>6 && pref[6]>0) return;
		if (pos>8 && pref[8]>0) return;
	}
	if (pos == 10) {
		if (pref[5]>0) if (pref[2]>0 || pref[4]>0 || pref[6]>0 || pref[8]>0) return;
		int d = get_dig_v(pref);
		if (d != 0) {
			digits[D-rem].pb(pref);
			fin_dig[D-rem].pb(d);
			total[D-rem]++;
		}
		return;
	}
	for (int i = 0; i <= rem; i++) {
		pref[pos] = i;
		rec(rem-i, pos+1);
	}
}

void init() {
	fact[0] = 1;
	FORI(k,D) fact[k] = fact[k-1] * k;
	pref.resize(10);
	rec(D, 1);
	
	FORI(k,D) {
		//printf("%d : %d\t", k, total[k]);
		int m = total[k];
		n_full[k].resize(m);
		FOR(i,m) {
			n_full[k][i] = n_comb(digits[k][i]);
			ans_d[k][fin_dig[k][i]] += n_full[k][i];
		}
		FORI(i,9) ans_d[k][i] += ans_d[k-1][i];
		//FORI(i,9) printf("%lld ", ans_d[k][i]);
		//printf("\n");
	}
}

int main() {
	init();
	int tt;
	scanf("%d", &tt);
	FOR(i,tt) test();
	return 0;
}