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
#include <bits/stdc++.h>
using namespace std;
#define fwd(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n)    fwd(i, 0, n)
#define all(X)       X.begin(), X.end()
#define sz(X)        int(size(X))
#define pb           push_back
#define eb           emplace_back
#define st           first
#define nd           second
using pii = pair<int, int>;
using vi = vector<int>;
using ll = long long;
using ld = long double;
#ifdef LOC
auto SS = signal(6, [](int) {
	*(int *)0 = 0;
});
#	define DTP(x, y)                                      \
		auto operator<<(auto &o, auto a)->decltype(y, o) { \
			o << "(";                                      \
			x;                                             \
			return o << ")";                               \
		}
DTP(o << a.st << ", " << a.nd, a.nd);
DTP(for (auto i : a) o << i << ", ", all(a));
void dump(auto... x) {
	((cerr << x << ", "), ...) << '\n';
}
#	define deb(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x)
#else
#	define deb(...) 0
#endif

typedef array<uint8_t, 10> count_t;

count_t count_digits(ll n) {
	count_t c;
	fill(all(c), 0);
	while (n) {
		c[n % 10ll]++;
		n /= 10ll;
	}
	return c;
}

ll multiply_digits(const count_t &c) {
	ll ans = 1;
	rep(i, 10) {
		rep(j, c[i]) {
			ans *= i;
		}
	}
	return ans;
}

ll evals_to_what(count_t &c) {
	ll number = multiply_digits(c);
	while (number >= 10)
		number = multiply_digits(count_digits(number));
	return number;
}

ll count_ways(const count_t &c, int sum) {
	ll ans = 1;
	fwd(i, 1, sum + 1) ans *= i;
	rep(i, 10) rep(j, c[i]) ans /= (j + 1);
	return ans;
}

struct digit_set {
	count_t counts;
	int sum;
	int evals;
	ll ways;
	digit_set(count_t c, int s) : counts(c), sum(s) {
		ways = count_ways(c, s);
		evals = evals_to_what(c);
	}
	digit_set() {
	}
};

vector<vector<digit_set> > digit_sets;
vector<vector<ll> > digit_set_ways;

// Count sets of digits that don't eval to 0
// Could possibly handle 1s differently
void prep_counts_recursive(
	count_t c, int sum, int next_digit, bool has_even, bool has_five) {
	if (sum > 0) {
		digit_set ds(c, sum);
		if (ds.evals != 0) {
			digit_sets[sum].pb(ds);
			digit_set_ways[sum][ds.evals] += ds.ways;
		}
	}
	if (sum == 18)
		return;
	fwd(i, next_digit, 10) {
		c[i]++;
		bool new_has_even = has_even || (i % 2 == 0);
		bool new_has_five = has_five || (i == 5);
		if (!new_has_even || !new_has_five)
			prep_counts_recursive(c, sum + 1, i, new_has_even, new_has_five);
		c[i]--;
	}
}

void prep_counts() {
	count_t c;
	fill(all(c), 0);
	digit_sets = vector<vector<digit_set> >(19);
	digit_set_ways = vector<vector<ll> >(19, vector<ll>(10));
	prep_counts_recursive(c, 0, 1, false, false);
}

vi get_digits(ll n) {
	vi digits;
	while (n) {
		digits.pb(n % 10);
		n /= 10;
	}
	reverse(all(digits));
	return digits;
}

struct num_stats {
	ll num;
	count_t count;
	int sum;
	vi digits;
	num_stats(ll n) :
		num(n),
		count(count_digits(n)),
		sum(accumulate(all(count), 0)),
		digits(get_digits(n)) {
	}
};

ll count_anagrams_less_than(const num_stats &ns, const digit_set &ds_ref) {
	static digit_set ds;
	ds = ds_ref;
	ll ans = 0;
	rep(i, ns.sum) {
		fwd(d, 1, ns.digits[i]) if (ds.counts[d] > 0) {
			ll new_ways = ds.ways;
			new_ways *= ds.counts[d];
			new_ways /= ns.sum - i;
			ans += new_ways;
		}
		if (ds.counts[ns.digits[i]] == 0)
			break;
		ds.ways *= ds.counts[ns.digits[i]];
		ds.ways /= ns.sum - i;
		ds.counts[ns.digits[i]] -= 1;
	}
	return ans;
}

void sol() {
	ll n;
	cin >> n;
	n += 1;
	array<ll, 10> result_cnt;
	fill(all(result_cnt), 0);
	result_cnt[0] = n - 1;
	num_stats ns(n);
	fwd(len, 1, 19) {
		if (len == ns.sum) {
			for (auto &c : digit_sets[len]) {
				ll cnt = count_anagrams_less_than(ns, c);
				result_cnt[c.evals] += cnt;
			}
		} else if (len < ns.sum) {
			rep(i, 10) result_cnt[i] += digit_set_ways[len][i];
		}
	}
	fwd(i, 1, 10) result_cnt[0] -= result_cnt[i];
	rep(i, 10) cout << result_cnt[i] << " ";
	cout << '\n';
}

int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	cout << fixed << setprecision(10);
	prep_counts();
	int t;
	cin >> t;
	rep(i, t) sol();
#ifdef LOCF
	cout.flush();
	cerr << "- - - - - - - - -\n";
	(void)!system(
		"grep VmPeak /proc/$PPID/status | sed s/....kB/\' MB\'/1 >&2"); // 4x.kB
																		// ....kB
#endif
}