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

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}"; }
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")"; }
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

vector<vector<int>> dig;

void rec(int n, int id, vector<int>& v) {
  if(n == 0 || id == 10) {
    dig.push_back(v);
    return;
  }
  for(int i = 0; i <= n; i++) {
    v[id] = i;
    rec(n - i, id + 1, v);
    v[id] = 0;
  }
}

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

  const int num = 18;
  vector<int> v(10);
  dig.reserve(14000000);
  rec(num, 0, v);
  unordered_map<ll, int> res;
  unordered_set<ll> st;
  for(int i = 0; i < dig.size(); i++) {
    ll prod = 1;
    for(int d = 0; d < 10; d++) {
      for(int j = 0; j < dig[i][d]; j++) prod *= d;
    }
    if(!prod || prod % 10 != 0) {
      st.insert(prod);
    }
    ll init = prod;
    while(prod >= 10) {
      ll cur = 1;
      while(prod) {
        cur *= prod % 10;
        prod /= 10;
      }
      prod = cur;
    }
    res[init] = prod;
  }

  vector<unordered_map<ll, array<ll, 10>>> ans(num + 1);
  for(ll prod : st) {
    ans[0][prod] = {};
    ans[0][prod][res[prod]]++;
  }
  ll bnd = 1e18;
  for(int k = 1; k < ans.size(); k++) {
    for(ll prod : st) {
      array<ll, 10> v = {};
      for(int d = 0; d < 10; d++) {
        if(!d || prod <= bnd / d) {
          ll nprod = prod * d;
          if(nprod % 10 == 0) nprod = 0;
          auto& vv = ans[k - 1][nprod];
          for(int i = 0; i < 10; i++) v[i] += vv[i];
        }
      }
      ans[k][prod] = v;
    }
  }

  int t;
  cin >> t;
  while(t--) {
    ll n;
    cin >> n;
    string s = to_string(n);
    vector<ll> v(10);
    for(int i = 0; i + 1 < s.length(); i++) {
      for(int d = 1; d < 10; d++) {
        auto& vv = ans[s.length() - i - 2][d];
        for(int j = 0; j < 10; j++) v[j] += vv[j];
      }
    }
    ll prod = 1;
    for(int i = 0; i < s.length(); i++) {
      for(int d = 0; d < s[i] - '0'; d++) {
        if(!i && !d) continue;
        ll nprod = prod * d;
        if(nprod % 10 == 0) nprod = 0;
        auto& vv = ans[s.length() - i - 1][nprod];
        for(int j = 0; j < 10; j++) v[j] += vv[j];
      }
      prod *= s[i] - '0';
    }
    v[res[prod]]++;
    for(int i = 0; i < 10; i++) {
      if(i) cout << " ";
      cout << v[i];
    }
    cout << '\n';
  }
}