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
153
154
155
156
157
158
159
160
161
162
163
164
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;

#define FOR(x, b, e) for(int x = (b); x <= (e); ++(x))
#define FORD(x, b, e) for(int x = (b); x >= (e); --(x))
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(a, b) for (auto&a : (b))
#define PB push_back
#define PF push_front
#define ST first
#define ND second
#define DBG(vari) cerr<<#vari<<" = "<<(vari)<<endl

template <typename T>
std::ostream& operator<<(std::ostream &output, const vector<T> &vec)
{
    output << "[";
    FOREACH(x, vec) output << x << ", ";
    output << "]";
    return output;
}

template <typename T, typename U>
std::ostream& operator<<(std::ostream &output, const pair<T,U> &p)
{
    output << "(";
    output << p.ST << ", " << p.ND;
    output << ")";
    return output;
}


vector<tuple<ll,vi,int,ll>> liczby[10]; // lacznie ~48k liczb
// x, cyfr, ilex, komb

int iloczyn_cyfr(ll x) {
  while (x >= 10LL) {
    ll iloczyn = 1LL;
    while (x) {
      iloczyn *= x % 10;
      x /= 10;
    }
    x = iloczyn;
  }
  return (int)x;
}

ll silnia[19];

ll kombinacje(vi& xcyfr, int ilex) {
  ll wyn = silnia[ilex];
  FOR(c, 1, 9)
    wyn /= silnia[xcyfr[c]];
  return wyn;

}

void bt(int left, ll x) {
  if (left == 0) {
    int iloczyn = iloczyn_cyfr(x);
    if (iloczyn != 0) {

      vi cyfr(10, 0);
      int ile = 0;
      auto x2 = x;
      while (x2) {
        cyfr[x2%10]++;
        x2/=10;
        ile++;
      }

      liczby[iloczyn].emplace_back(x, cyfr, ile, kombinacje(cyfr,ile)); 
    }
  }
  else
  {
    FOR(c, int(x % 10), 9)
      bt(left-1, x*10+c);
  }
}



ll policz(vi& xcyfr, int ilex, ll revn, int ilen, ll komb) {
  if (ilex == 0)
    return 1;

  if (ilex < ilen) {
    return komb;
  }
  else if (ilex == ilen) {
    ll ret = 0;

    int nc = int(revn % 10);

    FOR(c, 0, nc-1)
      if (xcyfr[c] > 0)
        ret += komb * xcyfr[c] / ilex;

    if (xcyfr[nc] > 0) {
      xcyfr[nc]--;
      ret += policz(xcyfr, ilex-1, revn / 10, ilen-1, komb * (xcyfr[nc]+1) / ilex); 
    }

    return ret;
  }
  else
  {
    return 0;
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  silnia[0] = 1;
  FOR(i, 1, 18) silnia[i] = silnia[i-1] * i;

  bt(18, 0);


  int t; cin >> t;

  while (t--) {
    ll n; cin >> n;
    vector<ll> wyn(10, 0);

    ll revn=0;
    int ilen=0;
    ll n2=n;
    while (n2) {
      revn = revn*10+(n2%10);
      n2/=10;
      ilen++;
    }

    FOR(c, 1, 9) {
      FOREACH(z, liczby[c]) {
        int x;
        vi cyfr;
        int ile;
        ll komb;
        tie(x, cyfr, ile, komb) = z;

        wyn[c] += policz(cyfr, ile, revn, ilen, komb);
      }
    }

    wyn[0] = n;
    FOR(i, 1, 9) wyn[0] -= wyn[i];

    REP(i, SIZE(wyn)) cout << wyn[i] << " ";
    cout << endl;
  }
}