#include <algorithm>
#include <iostream>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <deque>
#include <string>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <set>
using namespace std;
#define mm(a,i) memset(a, i, sizeof(a));
#define LL long long
#define Mod 1000000007
#define SC_C(s) scanf("%c", &s)
#define SC(a) scanf("%d", &a)
#define SCC(a,b) scanf("%d %d", &a, &b)
#define SCCC(a,b,c) scanf("%d %d %d", &a, &b, &c)
#define FXA(i,a,n) for(i=a; i<n; i++)
#define FDA(i,a,n) for(i=a; i>n; i++)
#define FXDA(i,a,n) for(i=a; i<=n; i++)
#define FDDA(i,a,n) for(i=a; i>=n; i++)
#define FXB(i,a,n) for(i=a; i<n; i--)
#define FDB(i,a,n) for(i=a; i>n; i--)
#define FXDB(i,a,n) for(i=a; i<=n; i--)
#define FDDB(i,a,n) for(i=a; i>=n; i--)
#define PF(n) printf("%d\n", n);
#define PFF(n,m) printf("%d %d\n", n, m);
#define PFFF(x,y,z) printf("%d %d %d\n", x, y, z);
#define PF_Case(i) printf("Case %d:\n",i);
#define PF_C(i) printf("%c:\n",i);
#define PF_L(x) printf("%I64d\n",x);
#define IN freopen("D:\\in.txt","r",stdin);
#define ENT printf("\n");
#define MAX(a,b) a>b?a:b
#define MIN(a,b) a<b?a:b
int a[10005][10]= {0};
int main() {
for(int i=1; i<10005; i++) {
for(int j=0; j<=9; j++) {
a[i][j] = a[i-1][j];
}
int k = i;
while(k) {
a[i][k%10]++;
k/=10;
}
}
int N;
cin>>N;
while(N--){
int x;
cin>>x;
for(int i=0; i<9; i++){
cout<<a[x][i]<<" ";
}
cout<<a[x][9]<<endl;
}
return 0;
}