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

#define ll long long
#define fors(u, n, s) for(ll u = (s); u < (n); u++)
#define foru(u, n) fors(u, n, 0)
#define f first
#define s second
#define vec vector
#define pb push_back
#define ir(a, b, x) (((a) <= (x)) && ((x) <= (b)))
#define us unsigned

#define pow pow69

using namespace std;

const ll N = 1e18 + 100;

vec<ll> second_step_vals;
vec<int> result;

const ll i2l = 18014398509481984;
const ll i3l = 150094635296999136;
const ll i5l = 3814697265625;
const ll i7l = 1628413597910449;

void init_second_steps() {
	second_step_vals.pb(0);

	for(ll i2 = 1; i2 <= i2l; i2 *= 2) for(ll i3 = 1; i3 <= i3l; i3 *= 3) {
		for(ll i5 = 1; i5 <= i5l; i5 *= 5) for(ll i7 = 1; i7 <= i7l; i7 *= 7) {
			__int128 x = 1;
			x *= i2; if(x > N) continue;
			x *= i3; if(x > N) continue;
			x *= i5; if(x > N) continue;
			x *= i7; if(x > N) continue;
			ll y = x;
			second_step_vals.pb(y);
		}
	}

	sort(second_step_vals.begin(), second_step_vals.end());

	for(auto i : second_step_vals) {
		while (i > 9) {
			ll next_i = 1;
			while (i != 0) {
				next_i *= (i%10);
				i = i/10;
			}
			i = next_i;
		}
		result.pb(i);
	}
}

unordered_map<ll, ll> mem[20];

ll free_inverse_image(ll x, int digits) {
	if (digits == 0) return (x==1);

	if (mem[digits].find(x) != mem[digits].end()) return mem[digits][x];

	ll out = 0;
	fors(i, 10, 1) {
		if (x%i != 0) continue;
		out += free_inverse_image(x/i, digits-1);
	}

	mem[digits][x] = out;
	return out;
}

ll inverse_image(ll x, ll limit) {
	vec<int> limit_digits;
	while(limit != 0) {
		limit_digits.pb(limit%10);
		limit /= 10;
	}

	int n = limit_digits.size();

	vec<int> tmp;
	tmp.resize(n);
	foru(i, n){
		tmp[i] = limit_digits[n-1-i];
	}
	swap(tmp, limit_digits);

	ll prefix_prod = 1;
	ll out = 0;
	
	foru(first_diff, n+1) {
		if(first_diff != 0) prefix_prod *= limit_digits[first_diff-1];
		if(prefix_prod == 0 || x%prefix_prod != 0) break;

		ll y = x/prefix_prod;

		if (first_diff == n) {
			out += (y==1);
			break;
		}

		if(first_diff == 0) { // case prefix of zeroes
			fors(i, n, 1) out += free_inverse_image(x, i);
		}

		fors(i, limit_digits[first_diff], 1) {
			if (y%i != 0) continue;
			ll z = y/i;
			out += free_inverse_image(z, n - 1 - first_diff);
		}
	}

	return out;
}

ll ans[10];

int main() {
	cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);

	init_second_steps();

	int t; cin >> t;

	foru(_i, t){
		foru(j, 10) ans[j] = 0;

		ll n; cin >> n;
		
		int idx = 0;
		while(true){
			if(result[idx] != 0) ans[result[idx]] += inverse_image(second_step_vals[idx], n);

			idx++;
			if((us ll)idx == second_step_vals.size() || second_step_vals[idx] > n) break;
		}

		ans[0] = n;
		fors(i, 10, 1) ans[0] -= ans[i];

		foru(j, 10) cout << ans[j] << " ";
		cout << endl;
	}
	
    return 0;
}