#include<bits/stdc++.h>

using i64 = int64_t;

i64 f(i64 x){
	if(x <= 9) return x;
	i64 p = 1;
	while(x){
		p *= (x % 10);
		x /= 10;
	}
	return f(p);
}

const int maxn = 1e7 + 1;

void DoSlow(std::vector<std::pair<int64_t, int64_t>> q){
	int S = q.size();
	int ptr = 0;
	std::vector<int> ans(10);
	std::vector<std::vector<int>> res(S);
	for(int i = 1;i < maxn;i++){
		ans[f(i)] += 1;
		while(q[ptr].first < i) ptr += 1;
		if(q[ptr].first == i){
			res[q[ptr].second] = ans;
		}
	}
	for(auto &v : res){
		for(auto &x : v){
			std::cout << x << ' ';
		}
		std::cout << '\n';
	}
}

int main(){
	using namespace std;
	ios::sync_with_stdio(false), cin.tie(nullptr);
	
	int Q;
	cin >> Q;
	
	vector<pair<int64_t, int64_t>> quers(Q);
	for(int i = 0;i < Q;i++){
		cin >> quers[i].first, quers[i].second = i;
	}
	
	sort(quers.begin(), quers.end());

	if(quers.back().first <= maxn){
		DoSlow(quers);
		return 0;
	}
	
	return 0;
}