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
// PA2025, @mjm, r3b-mno

#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <functional>
using namespace std;
using ull = unsigned long long;
inline int nextInt() { int n; scanf("%d", &n); return n; }
inline ull nextUll() { ull n; scanf("%llu", &n); return n; }
inline int myMin(int a, int b) { return a <= b ? a : b; }
inline ull myMax(ull a, ull b) { return a >= b ? a : b; }

int fun(ull v) {
	while (v >= 10) {
		ull mn = 1;
		while (v > 0) {
			mn *= v % 10;
			v /= 10;
		}
		v = mn;
	}
	return v;
}


int finn[] = { 0, 1, 33, 1, 9, 12, 84, 1, 51, 1 };
ull fin[10][84] = { {}
	, {1ULL}
	, {2ULL,12ULL,21ULL,112ULL,126ULL,162ULL,216ULL,729ULL,972ULL,1134ULL,1728ULL,1792ULL,2187ULL,8748ULL,13122ULL,14336ULL,33614ULL,61236ULL,93312ULL,268912ULL,314928ULL,321489ULL,393216ULL,1229312ULL,1411788ULL,1741824ULL,3111696ULL,7112448ULL,9633792ULL,11239424ULL,116169984ULL,368947264ULL,1811939328ULL}
	, {3ULL}
	, {4ULL,14ULL,27ULL,72ULL,98ULL,189ULL,294ULL,1161216ULL,128421199872ULL}
	, {5ULL,15ULL,35ULL,75ULL,135ULL,175ULL,315ULL,1575ULL,1715ULL,3375ULL,59535ULL,77175ULL}
	, {6ULL,16ULL,28ULL,32ULL,48ULL,84ULL,128ULL,144ULL,147ULL,168ULL,224ULL,288ULL,378ULL,441ULL,448ULL,672ULL,686ULL,784ULL,882ULL,1344ULL,1764ULL,1944ULL,2646ULL,2744ULL,6174ULL,6272ULL,8192ULL,11664ULL,18144ULL,23328ULL,24192ULL,27216ULL,28672ULL,34992ULL,41472ULL,49392ULL,67228ULL,71442ULL,96768ULL,111132ULL,122472ULL,139968ULL,148176ULL,163296ULL,214326ULL,221184ULL,236196ULL,331776ULL,642978ULL,666792ULL,1382976ULL,1492992ULL,1778112ULL,1843968ULL,2117682ULL,2667168ULL,2939328ULL,3211264ULL,3687936ULL,9437184ULL,9483264ULL,13226976ULL,13716864ULL,19361664ULL,46294416ULL,69441624ULL,71663616ULL,133413966ULL,169869312ULL,184473632ULL,226492416ULL,914838624ULL,1162261467ULL,1792336896ULL,2113929216ULL,3281116734ULL,3699376128ULL,4444263936ULL,11329339392ULL,23612624896ULL,913217421312ULL,13884223438848ULL,1438916737499136ULL,3416267673274176ULL}
	, {7ULL}
	, {8ULL,18ULL,24ULL,36ULL,42ULL,49ULL,63ULL,64ULL,81ULL,192ULL,243ULL,324ULL,343ULL,432ULL,486ULL,648ULL,864ULL,896ULL,1176ULL,1323ULL,1372ULL,2268ULL,4116ULL,12348ULL,13824ULL,14112ULL,18432ULL,23814ULL,32928ULL,42336ULL,43218ULL,112896ULL,124416ULL,131712ULL,137781ULL,177147ULL,413343ULL,691488ULL,941192ULL,1166886ULL,1361367ULL,1417176ULL,3779136ULL,4148928ULL,33718272ULL,1194891264ULL,1783627776ULL,4182119424ULL,1121144263281ULL,112717121716224ULL,727326941773824ULL}
	, {9ULL}
};

map<ull, ull> cnt[19][10];
const ull ZERO = 0;
const ull ONE = 1;

ull myGet(int lvl, int d, ull key) {
	if (cnt[lvl][d].count(key) == 0) return ZERO;
	return cnt[lvl][d].at(key);
}

void init() {
	for (int d = 1; d <= 9; ++d) {
		queue<ull> q;
		for (int i = 0; i < finn[d]; ++i) {
			q.push(fin[d][i]);
			cnt[0][d][fin[d][i]] = ONE;
		}
		for (int lvl = 1; lvl <= 18; ++lvl) {
			int n = q.size();
			while (n--) {
				ull v = q.front();
				q.pop();
				ull c = cnt[lvl - 1][d][v];
				for (int dig = 1; dig <= 9; ++dig) {
					if (v % dig != 0) continue;
					ull vv = v / dig;
					if (cnt[lvl][d].count(vv) == 0) {
						cnt[lvl][d][vv] = c;
						q.push(vv);
					} else {
						cnt[lvl][d][vv] += c;
					}
				}
			}
		}
	}
}

void solve(ull n) {
	vector<ull> res(10, ZERO);
	res[0] = n;
	const ull MLD = 1000000000;
	const ull MAX = MLD * MLD;
	if (n == MAX) --n;

	deque<int> digits;
	{
		ull nn = n;
		while (nn > 0) {
			digits.push_front(nn % 10);
			nn /= 10;
		}
	}
	int k = digits.size();
	for (int idx = 1; idx <= 9; ++idx) {
		ull& rr = res[idx];
		rr = ZERO;
		for (int kk = k - 1; kk > 0; --kk) {
			rr += myGet(kk, idx, ONE );
		}

		ull mn = 1;
		bool useLast = true;
		for (int i = 0; i < k; ++i) {
			if (0 == myGet(k - i, idx, mn)) {
				useLast = false;
				break;
			}
			if (digits[i] == 0) {
				useLast = false;
				break;
			}
			for (int d = 1; d < digits[i]; ++d) {
				rr += myGet(k - (i + 1), idx, mn * d);
			}
			mn *= digits[i];
		}
		if (useLast) {
			rr += myGet(0, idx, mn);
		}
	}

	// ======== finish: count res[0] ========
	for (int i = 1; i <= 9; ++i) res[0] -= res[i];
	printf("%llu", res[0]);
	for (int i = 1; i <= 9; ++i) printf(" %llu", res[i]);
	printf("\n");
}

int main() {
	init();
	int TC = nextInt();
	for (int tc = 0; tc < TC; ++tc) {
		ull n = nextUll();
		solve(n);
	}
	return 0;
}