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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
#include <bits/stdc++.h>
using namespace std;

const int N = 1e6 + 5;

#define st first
#define nd second

typedef pair<int,int> pun;
typedef long long ll;

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};


const ll M = 1e18+5;

vector<map<ll, ll>> tens_sum; // result for x < 10^d
vector<map<ll, ll>> tens_acc; // all digits (including trailing zeroes)

vector<ll> tens_acc_sum;

void compute_tens_accum() {

	tens_acc_sum.resize(tens_acc.size(), 0);
	for (int i = 0; i < tens_acc.size(); i++) {
		for (auto q : tens_acc[i]) {
			tens_acc_sum[i] += q.nd;
		}
	}
}

unordered_map<long long, int> mno_mem; 

int MNO_MEM = 1000 * 1000;
vector<int> mno_mem_lookup;

void compute_mno_mem() {
	mno_mem_lookup.resize(MNO_MEM);
	for (int i = 0; i < MNO_MEM; i ++) {
		string s = to_string(i);
		int res = 1;
		for (char c : s) {
			res *= c -'0';
		}
		mno_mem_lookup[i] = res;
	}
}

int mno(ll x) {
	if (x % 10 == 0) return 0;
	auto iter = mno_mem.find(x);
	if (iter != mno_mem.end()) return iter->second;
	ll res = x;
	while (res >= 10) {
		ll new_res = 1;
		while (res > 0) {
//			cerr << res % MNO_MEM;
			new_res *= mno_mem_lookup[res % MNO_MEM];
			res /= MNO_MEM;
		}
		res = new_res;
	}
	mno_mem[x] = res;
	return res;
}

map<ll, ll> normalize(map<ll, ll> m) {
	map<ll, ll> res;
	for (pair<ll, ll> p : m) {
		if (p.st % 10 == 0) res[0] += p.nd;
		else res[p.st] += p.nd;
	}
	return res;
}


void print_all(map<ll, ll> res) {
	for (auto p : res) {
		cout << p.st <<": " << p.nd << " ";
	}
	cout<<"\n";
}


void print_amp(map<ll, ll> res) {
	for (int i = 0; i <= 9; i++) {
		cout << res[i] << " ";
	}
	cout<<"\n";
}

void print(vector<ll> res) {
	for (int i = 0; i <= 9; i++) {
		cout << res[i] << " ";
	}
	cout<<"\n";
}

void compute_tens(long long max) {
	tens_acc.push_back(map<ll, ll>());
	tens_acc[0][1] = 1;

	tens_sum.push_back(map<ll, ll>());

	long long ten = 1;
	while (ten  <= max / 10) {
		map<ll, ll> v;
		ten *= 10;
		int idx = tens_acc.size();
		tens_acc.push_back(map<ll, ll>());
		tens_sum.push_back(map<ll, ll>());	
//		cerr << ten << "\n";
		for (int d = 0; d <= 9; d ++) {
			for (pair<ll, ll> p : tens_acc[idx-1]) {
				ll f = d * p.st;
				v[f] += p.second;
			}
		}
		tens_acc[idx] = normalize(v);

		v = map<ll, ll>();
		for (int d = 1; d <= 9; d ++) {
			for (pair<ll, ll> p : tens_acc[idx-1]) {
				int f = mno(d * p.st);
				v[f] += p.second;
			}
		}

		for (pair<ll, ll> p : tens_sum[idx-1]) {
			v[p.st] += p.second;
		}

		tens_sum[idx] = v;
	}
}


void compute(ll n) {
	vector<ll> digits;
	vector<ll> ts;
	ll ten = 0;
	while (n > 0) {
		digits.push_back(n % 10);
		ts.push_back(ten);
		ten++;
		n /= 10;
	}
	reverse(digits.begin(), digits.end());
	reverse(ts.begin(), ts.end());

//	print(digits);
//	print(ts);

	vector<ll> v(10, 0);
	ll mno_acc = 1;
	for (int i = 0; i < digits.size(); i ++) {
		int start = 0;
		if (i == 0) start = 1;
		for (int d = start; d < digits[i]; d ++) {
			ll part = mno_acc *d;
			if (part % 10 == 0) {
				v[0] += tens_acc_sum[ts[i]];
			}
			else for (pair<ll, ll> p : tens_acc[ts[i]]) {
				int f = mno(part * p.st);
//				cerr << "summing";
//				for (int j = 0; j < i; j ++) {
//					cerr << digits[j];
//				}
//				cerr <<  d << " + " << p.st << "->" << f << ": ";
//				cerr << "add " << p.nd << "\n";
				v[f] += p.nd;
			}
		}
		mno_acc = mno_acc * digits[i];
		
	}

//	cerr << "add " << mno_acc <<"\n";
	v[mno(mno_acc)] ++;
	for (int i = 0; i <= 9; i ++) v[i] += tens_sum[ts[0]][i];
	print(v);
}

void test() {
	long long n;
	cin >> n;
	compute(n);
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	mno_mem.reserve(50000);
	mno_mem.max_load_factor(1.0f);
	compute_mno_mem();
	compute_mno_mem();
	compute_tens(M);
	compute_tens_accum();
//	print(tens_sum[10]);
//	print_all(tens_sum[100]);
	int t;
	cin >> t;
	while(t--) test();
//	cerr << mno_mem.size();
}