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
149
150
151
152
#include <bits/stdc++.h>
using namespace std;
#define ll long long

int mapa[19][19][19*3][19*4];
ll rez[50'000];
int wre[50'000][4];
// ll 
ll dp[50'000][19];
vector<int> specialz;
int algo(int l7, int l5, int l3, int l2)
{
   if (mapa[l7][l5][l3][l2])
   {
      return mapa[l7][l5][l3][l2];
   }
   ll p7 = pow(7LL, l7);
   ll p5 = pow(5LL, l5);
   ll p3 = pow(3LL, l3);
   ll p2 = pow(2LL, l2);
   int n7 = 0;
   int n5 = 0;
   int n3 = 0;
   int n2 = 0;
   ll sk = p7 * p5 * p3 * p2;
   if (sk < 10)return sk;
   for (; sk;sk/=10)
   {
      int a = sk % 10;
      if (!a)return 10;
      while (!(a % 2LL))
      {
         n2++;
         a/=2LL;
      }
      while (!(a % 3LL))
      {
         n3++;
         a/=3LL;
      }
      if (!(a % 5LL))
      {
         n5++;
         a/=5LL;
      }
      if (!(a % 7LL))
      {
         n7++;
         a/=7LL;
      }
   }
   mapa[l7][l5][l3][l2] = algo(n7, n5, n3, n2);
   return mapa[l7][l5][l3][l2];
}

map<ll, int> zli;

int main()
{
   ios::sync_with_stdio(0); cin.tie(0);
   ll z = 0;
   for (int l7 = 0; l7 <= 18; l7++)
   {
      for (int l5 = 0; l5 + l7 <= 18; l5++)
      {
         for (int l3 = 0; l3/2 + l5 + l7 <= 18; l3++)
         {
            for (int l2 = 0; l2/3 + l3/2 + l5 + l7 <= 18; l2++)
            {
               mapa[l7][l5][l3][l2] = algo (l7, l5, l3, l2);
               // cout << l2 << ' ' << l3 << ' ' << l5 << ' ' << l7 << ' ' << mapa[l7][l5][l3][l2] << '\n';
               ll p7 = pow(7LL, l7);
               ll p5 = pow(5LL, l5);
               ll p3 = pow(3LL, l3);
               ll p2 = pow(2LL, l2);
               zli[p7*p5*p3*p2]=++z;
               wre[z][0] = l7;
               wre[z][1] = l5;
               wre[z][2] = l3;
               wre[z][3] = l2;
               rez[z] = p7*p5*p3*p2;
               
               if (mapa[l7][l5][l3][l2] < 10)
               {
                  specialz.push_back(z);
               }
            }
         }
      }
   }
   // cerr << zli.size();
   dp[zli[1]][0] = 1;
   for (int i = 1; i < 19; i++)
   {
      for (int a = 1; a <= z; a++)
      {
         ll sk = rez[a];
         for (int l = 1; l < 10; l++)
         {
            if (sk % l)continue;
            dp[a][i] += dp[zli[sk/l]][i-1];
         }
      }
   }
   int n;
   ll a;
   cin >> n;
   while(n--)
   {
      cin >> a;
      a++;
      ll ans[10] = {};
      ll l = 1;
      int it = 17;
      for (ll k = 1e17; k; k/=10, it--)
      {
         if (a < k)continue;
         ll c = a / k;
         c %= 10;
         for (int i = 1; i < c; i++)
         {
            for (auto j : specialz)
            {
               if (rez[j] % (l * i))continue;
               ans[mapa[wre[j][0]][wre[j][1]][wre[j][2]][wre[j][3]]]+=dp[zli[rez[j]/l/i]][it];
            }
         }
         l *= c;
         if (!c)break;
      }
      it = 1;
      for (ll k = 1; 10 * k <= a; k*=10)
      {
         for (auto j : specialz)
         {
            ans[mapa[wre[j][0]][wre[j][1]][wre[j][2]][wre[j][3]]] += dp[j][it];
         }
         it++;
      }
      ans [0] = a-1;
      for (int i = 1; i < 10; i++)
      {
         ans[0] -= ans[i];
      }
      for (int i = 0; i < 10; i++)
      {
         cout << ans[i] << ' ';
      }
      cout << '\n';
   }
   return 0;
}