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
#include<bits/stdc++.h>

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)


#define VI vector<int>
#define PII pair<int,int>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define lint long long int


#define debug(x) {cerr <<#x <<" = " <<x <<endl; }
#define debug2(x,y) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y <<endl; }
#define debug3(x,y,z) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y << ", " << #z << " = " << z <<endl; }
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<endl; }}
#define debugt(t,n) {{cerr <<#t <<" = "; FOR(it,0,(n)) cerr <<t[it] <<", "; cerr <<endl; }}


#define make( x) int (x); scanf("%d",&(x));
#define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y));
#define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z));
#define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define IOS ios_base::sync_with_stdio(0)
#define HEAP priority_queue


#define read( x) scanf("%d",&(x));
#define read2( x, y) scanf("%d%d",&(x),&(y));
#define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z));
#define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t));


using namespace std;

vector<lint> p10;
map<lint, int> memo;

lint prod(lint x) {
	if (x < 10) return x;
	return (x%10) * prod(x/10);
}

int rob(lint x) {
	if (x < 10) return x;
	if (memo.find(x) != memo.end()) {
		return memo[x];
	}
	int ja = rob(prod(x));
	memo[x] = ja;
	return ja;
}

map<lint, vector<lint> > dp[20];
vector<lint> doit2(int len, lint prod_so_far) {
	if (len == 0) {
		vector<lint> res(10, 0LL);		
		res[rob(prod_so_far)] = 1;
		return res;
	}
	if (dp[len].find(prod_so_far) != dp[len].end()) return dp[len][prod_so_far];
	vector<lint> res(10, 0LL);		
	FOR(i,0,10) {
		vector<lint> tmp = doit2(len - 1, prod_so_far * i);
		FOR(j,0,10) res[j] += tmp[j];
	}
	dp[len][prod_so_far] = res;
	return res;
}

vector<lint> doit(lint n) {
	vector<lint> res(10, 0LL);		
	if (n < 10) {
		for (int i = 1; i <= n; i++) res[i] = 1;
		return res;
	}

	VI digs;
	while (n) {
		digs.pb(n%10);
		n = n / 10;
	}
	FOR(k,0,digs.size()-1) {
		FOR(d,1,10) {
			vector<lint> tmp = doit2(k, d);
			FOR(u,0,10) res[u] += tmp[u];
		}
	}

	lint prod_so_far = 1;
	for (int k = digs.size() - 1; k >= 0; k--) {
		int digit = digs[k];
		FOR(j,0,digit) {
			if (j == 0 && k == digs.size()-1) continue;
			vector<lint> tmp = doit2(k, prod_so_far * j);
			FOR(u,0,10) res[u] += tmp[u];
		}
		prod_so_far *= digit;
	}
	res[rob(prod_so_far)]++;
	return res;
}

void prepare() {
	p10.pb(1);
	FOR(i,0,18) p10.pb(p10.back() * 10LL);
}

void solve() {
	lint x; scanf("%lld", &x);
	vector<lint> res = doit(x);
	FOR(i,0,10) {
		printf("%lld ", res[i]);
	}
	printf("\n");
}

int main() {
	prepare();
	make(z);
	while (z--) {
		solve();
	}
}