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
#include <bits/stdc++.h>
using namespace std;
const long long Lim=1e18;
long long G(long long x)
{
    if(x<10){return x;}
    long long w=1;
    while(x>0)
    {
        w*=x%10;
        x/=10;
    }
    return G(w);
}
const vector<int>P={2,3,5,7};
set<long long>S;
vector<pair<long long,int>>Ziomska;
void F2(int v, long long x)
{
    if(v==P.size())
    {
        S.insert(x);
        return;
    }
    while(true)
    {
        F2(v+1,x);
        if(x%P[v]!=0){break;}
        x/=P[v];
    }
}
void F(int v, long long x)
{
    if(v==P.size())
    {
        if(G(x)==0){return;}
        Ziomska.push_back({x,G(x)});
        F2(0,x);
        return;
    }
    while(x<=Lim)
    {
        F(v+1,x);
        x*=P[v];
    }
}
vector<long long>Wyn(long long x)
{
    vector<long long>W(10);
    for(long long i=1;i<=x;i++)
    {
        W[G(i)]++;
    }
    return W;
}
const int R=20;
map<long long,long long>M[R];
int main()
{ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    F(0,1);
    M[0][1]=1;
    for(int i=0;i+1<R;i++)
    {
        for(pair<long long,long long>xd : M[i])
        {
            for(int j=1;j<=9;j++)
            {
                long long x2=xd.first*j;
                if(S.find(x2)==S.end()){continue;}
                M[i+1][x2]+=xd.second;
            }
        }
    }
    int n;
    cin>>n;
    for(int I=1;I<=n;I++)
    {
        long long x,x2;
        cin>>x;
        x2=x;
        vector<long long>W(10);
        W[G(x)]++;
        vector<int>L;
        while(x2>0)
        {
            L.push_back(x2%10);
            x2/=10;
        }
        reverse(L.begin(),L.end());
        long long ilo=1;
        for(int i=0;i<L.size();i++)
        {
            int u=L[i];
            for(int j=1;j<u;j++)
            {
                long long ilo2=ilo*j;
                for(auto[liczba,g] : Ziomska)
                {
                    if(liczba%ilo2!=0){continue;}
                    if(S.find(liczba/ilo2)==S.end()){continue;}
                    W[g]+=M[L.size()-i-1][liczba/ilo2];
                }
            }
            ilo*=u;
            if(ilo==0){break;}
        }
        for(int i=1;i<L.size();i++)
        {
            for(auto[liczba,g] : Ziomska)
            {
                W[g]+=M[i][liczba];
            }
        }
        long long suma=0;
        for(long long u : W)
        {
            suma+=u;
        }
        W[0]+=x-suma;
        for(long long u : W)
        {
            cout<<u<<" ";
        }
        cout<<'\n';
        /**vector<long long>W2=Wyn(x);
        for(long long u : W2)
        {
            cout<<u<<" ";
        }
        cout<<'\n';
        if(W!=W2)
        {
            cout<<"x="<<x<<endl;
            return 0;
        }**/
    }
    return 0;
}