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
// Author: Olaf Surgut (surgutti)
// Created on 12-03-2025 13:36:55
#include "bits/stdc++.h"
using namespace std;

#define int long long
#define ll long long
#define ld long double

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(x) begin(x),end(x)
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)

auto& operator<<(auto &o, pair<auto, auto> p) {
	return o << "(" << p.st << ", " << p.nd << ")";}
auto operator<<(auto &o, auto x)->decltype(end(x), o) {
	o << "{"; int i=0; for (auto e : x) o << ","+!i++ << e;
	return o << "}";}

#ifdef LOCAL
#define debug(x...) cerr << "[" #x "]: ", [](auto...$) { \
	((cerr << $ << "; "),...) << endl; }(x)
#else
#define debug(...)
#endif

#define rep(i,a,b) for(int i = a; i < (b); i++)
using pii = pair<int, int>;
using vi = vector<int>;

const int N = 1e18L + 7;
const int K = 65000;

const int limits[4] = {3 * 17, 2 * 17, 17, 17};
const int primes[4] = {2, 3, 5, 7};

int f(int x) {
	int res = 1;
	while (x > 0) {
		res *= x % 10;
		x /= 10;
	}
	return res;
}

int g(int x) {
	while (x > 9)
		x = f(x);
	return x;
}

typedef array<int, 4> S;

S operator+ (S const& a, S const& b) {
	S res;
	rep(i, 0, 4)
		res[i] = a[i] + b[i];
	return res;
}

int val(S v) {
	int res = 1;
	rep(i, 0, 4) {
		while (v[i]--)
			res *= primes[i];
	}
	return res;
}

string n;
int idx[3 * 18 + 1][2 * 18 + 1][18 + 1][18 + 1];
vector<S> good;

void jazda(int i, int now, S v) {
	if (i == 4) {
		good.pb(v);
		idx[v[0]][v[1]][v[2]][v[3]] = sz(good);
		return;
	}

	FOR(j, 0, limits[i]) {
		jazda(i + 1, now, v);

		if ((__int128) now * primes[i] > N)
			break;
		
		now *= primes[i];
		v[i]++;
	}
}

int _sum[19][K][10];
int* sum(int len, S const& v) {
	return _sum[len][idx[v[0]][v[1]][v[2]][v[3]]];
}

const S digits[10] = {
	{-1,-1,-1,-1},// 0
	{0, 0, 0, 0}, // 1
	{1, 0, 0, 0}, // 2
	{0, 1, 0, 0}, // 3
	{2, 0, 0, 0}, // 4
	{0, 0, 1, 0}, // 5
	{1, 1, 0, 0}, // 6
	{0, 0, 0, 1}, // 7
	{3, 0, 0, 0}, // 8
	{0, 2, 0, 0}  // 9
};

void solve() {
	cin >> n;
	
	vi ans(10);

	S v{0, 0, 0, 0};
	FOR(len, 1, sz(n)) {
		int cur_d = n[len - 1] - '0';

		rep(d, 1, cur_d) FOR(i, 1, 9)
			ans[i] += sum(sz(n) - len, v + digits[d])[i];

		if (cur_d == 0)
			break;
		
		v = v + digits[cur_d];
	}

	FOR(len, 1, sz(n) - 1)
		FOR(i, 1, 9) {
			ans[i] += sum(len, {0, 0, 0, 0})[i];
			if (sum(len, {0, 0, 0, 0})[i]) {
				debug(len, i, sum(len, {0, 0, 0, 0})[i]);
			}
		}

	debug(g(stoll(n)));

	ans[g(stoll(n))]++;

	ans[0] = stoll(n);
	FOR(d, 1, 9)
		ans[0] -= ans[d];
	
	FOR(d, 0, 9)
		cout << ans[d] << ' ';
	cout << '\n';
}

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	
	jazda(0, 1, {0, 0, 0, 0});
	assert(sz(good) < K);
	debug(sz(good));

	for (S const& v : good)
		sum(0, v)[g(val(v))]++;
	
	FOR(len, 1, 18)
		for (S const& v : good)
			FOR(d, 1, 9) {
				S const w = v + digits[d];
				FOR(i, 1, 9)
					sum(len, v)[i] += sum(len - 1, w)[i];
			}

	int t;
	cin >> t;
	while (t--) {
		solve();
	}

	return 0;
}