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
165
166
#include <bits/stdc++.h>
using namespace std;

using _ll = long long;
#define int _ll

#define loop(i, a, b) for(int i = a; i <= b; i++)
#define loop_rev(i, a, b) for(int i = a; i >= b; i--)
#define all(x) x.begin(), x.end()
#define sz(x) int(x.size())
#define eb emplace_back
#define pb push_back

unordered_map<int, int> f_res;
constexpr int PROD_FUN_PREP = 100'000;
array<int, PROD_FUN_PREP + 1> prod_fun_res;

inline int util(int x) {
  int res = 1;
  do {
    res *= x % 10;
    x /= 10;
  } while(x);
  return res;
}

inline int prod_fun(int x) {
  if(x <= PROD_FUN_PREP) {
    return prod_fun_res[x];
  }
  else  {
    return util(x);
  }
}

int f(int x) {
  int& w = f_res[x];
  if(w) return (w - 1);
  if(x < 10) {
    w = (x + 1);
    return w - 1;
  }
  w = (f(prod_fun(x)) + 1);
  return w - 1;
}

array<vector<tuple<int, int, array<int, 10>>>, 20> at_len;
int max_len;
array<int, 10> cnt;
constexpr int inf = 1e18;

void rec(int len, int prod, int curr_dig) {
  if(len > max_len || prod > inf) return;
  if(int f_val = f(prod); f_val != 0) {
    at_len[len].pb({ f_val, 1, cnt });
  }
  loop(new_dig, curr_dig, 9) {
    ++cnt[new_dig];
    rec(len + 1, prod * new_dig, new_dig);
    --cnt[new_dig];
  }
}

vector<vector<int>> psum;
vector<int> fact;

void solve();

signed main() {
  cin.tie(0)->sync_with_stdio(0);

  max_len = (1 + log10(1'000'000'000LL * 1'000'000'000LL));
  psum.resize(max_len + 1, vector<int>(10));
  fact.resize(max_len + 1, 1);

  loop(i, 1, PROD_FUN_PREP) {
    prod_fun_res[i] = util(i);
  }

  loop(digit, 1, 9) {
    ++cnt[digit];
    rec(1, digit, digit);
    --cnt[digit];
  }

  loop(i, 1, max_len) {
    fact[i] = fact[i - 1] * i;
  }

  loop(len, 1, max_len) {
    loop(d, 1, 9) {
      psum[len][d] = psum[len - 1][d];
    }
    for(auto& [ f_val, newton, cnt_arr ] : at_len[len]) {
      int res = fact[len];
      loop(i, 1, 9) {
        res /= fact[cnt_arr[i]];
      }
      psum[len][f_val] += res;
      newton = res;
    }
  }

  int t; cin >> t;

  while(t--) {
    solve();
  }

}

void solve() {
  int n; cin >> n;

  int len = 0;
  {
    int k = n;
    while(k) {
      k /= 10;
      ++len;
    }
  }
  vector<int> res(10);

  loop(d, 0, 9) {
    res[d] += psum[len - 1][d];
  }

  string numstr = to_string(n);
  vector<int> num(len);
  loop(i, 0, len - 1) {
    num[i] = numstr[i] - '0';
  }

  for(auto [ f_val, newton, cnt_arr ] : at_len[len]) {
    int fine_at = (-1);
    loop(i, 0, len - 1) {
      loop(d, 1, num[i] - 1) {
        if(!cnt_arr[d]) continue;
        res[f_val] += newton * cnt_arr[d] / (len - i);
      }
      if(!cnt_arr[num[i]]) {
        break;
      }
      newton = newton * cnt_arr[num[i]] / (len - i);
      --cnt_arr[num[i]];
      ++fine_at;
    }
    if(fine_at == len-1) {
      ++res[f_val]; // equal n
    }
  }

  int sum = 0;
  loop(i, 1, 9) {
    sum += res[i];
  }

  res[0] = n - sum;

  loop(i, 0, 9) {
    cout << res[i] << ' ';
  }
  cout << '\n';

}