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

using ll = int64_t;

const vector<int> pr = {2, 3, 5, 7};
vector<vector<int>> vp;
void init(){
	vp.assign(10, vector<int>(4));
	for(int i = 1; i < 10; i++){
		int x = i;
		for(int j = 0; j < 4; j++){
			while(x % pr[j] == 0){
				x /= pr[j];
				vp[i][j]++;
			}
		}
		assert(x == 1);
	}
}

vector<int> bad = {-1};
int droot(vector<int> x){
	if(x.empty()) return 0;
	if(x == bad) return 0;
	ll r = 1;
	for(ll i = 0; i < 4; i++){
		for(int j = 0; j < x[i]; j++) r *= pr[i];
	}
	if(r < 10) return r;
	vector<int> freq(4, 0);
	while(r){
		int a = r % 10;
		if(a == 0) return 0;
		for(int i = 0; i < 4; i++){
			freq[i] += vp[a][i];
		}
		r /= 10;
	}
	return droot(freq);
}
vector<int> tr(vector<int> a, int d) {
	if(a == bad) return bad;
	if(d > 0){
		if(a.empty()) a = vector<int>(4, 0);
		for(int i = 0; i < 4; i++) a[i] += vp[d][i];
		if(a[0] && a[2]) return bad;
	} else if(!a.empty()){
		return bad;
	}
	return a;
};

vector<vector<int> > states;
map<vector<int>, int> id;
vector<vector<int> > tr_st;
vector<int> droot_st;
int S;
int get_id (vector<int> v){
	if(!id.count(v)){
		int k = (int)id.size();
		id[v] = k;
		states.push_back(v);
		tr_st.push_back(vector<int>(10, 0));
	}
	return id[v];
}

void gen_graph(){
	set<int> cur;
	cur.insert(get_id({}));
	for(int l = 0; l < 18; l++){
		set<int> ncur = cur;
		for(int d = 0; d < 10; d++){
			for(int cid : cur){
				int nid = get_id(tr(states[cid], d));
				tr_st[cid][d] = nid;
				ncur.insert(nid);
			}
		}
		cur = ncur;
	}
	S = (int)states.size();
	droot_st.resize(S);
	for(int i = 0; i < S; i++){
		droot_st[i] = droot(states[i]);
	}
}

vector<ll> get_freqs(ll N){
	N++;
	vector<ll> freq(S, 0);
	int pref_id = get_id({});
	string s = to_string(N);
	for(char c : s){
		int digit = c - '0';
		vector<ll> nfreq(S, 0);
		for(int cid = 0; cid < S; cid++){
			if(freq[cid]){
				for(int d = 0; d < 10; d++){
					int nid = tr_st[cid][d];
					nfreq[nid] += freq[cid];
				}
			}
		}
		for(int d = 0; d < digit; d++){
			int nid = tr_st[pref_id][d];
			nfreq[nid] += 1;
		}
		pref_id = tr_st[pref_id][digit];
		freq = nfreq;
	}
	vector<ll> cnts(10, 0);
	for(int cid = 0; cid < S; cid++){
		int val = droot_st[cid];
		cnts[val] += freq[cid];
	}
	// ll tot = N-1;
	// for(int i = 1; i < 10; i++) tot -= cnts[i];
	// cnts[0] = tot;
	cnts[0]--;
	return cnts;
}

void solve(){
	ll N;
	cin >> N;
	vector<ll> a = get_freqs(N);
	for(int i = 0; i < 10; i++){
		cout << a[i] << " \n"[i+1 == 10];
		// cerr << a[i] << " \n"[i+1 == 10];
	}
}

int main(){
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	init();
	gen_graph();
	int T;
	cin >> T;
	while(T--) solve();
}