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
#include <algorithm>
#include <bitset>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>

using namespace std;

#define PB push_back
#define MP make_pair
#define F first
#define S second
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) (int)(x).size()
#define CLEAR(tab) memset(tab, 0, sizeof(tab))
#define REP(x, n) for(int x = 0; x < (n); x++)
#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 VAR(v, n) __typeof(n) v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG(fmt, ...) fprintf(stderr, fmt, ##__VA_ARGS__)

typedef long long int LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

const int MXN = 410;
const int C = 262144;
const int INF = 1000000001;
const int MOD = 1000000007;

VI primes = {2, 3, 5, 7};
VI factors[10] = {
    {0, 0, 0, 0},
    {0, 0, 0, 0},
    {1, 0, 0, 0},
    {0, 1, 0, 0},
    {2, 0, 0, 0},
    {0, 0, 1, 0},
    {1, 1, 0, 0},
    {0, 0, 0, 1},
    {3, 0, 0, 0},
    {0, 2, 0, 0}
};

int calc_digit(int zero, int cnt, VI fac) {
    if(zero || cnt == 0)
        return 0;
    LL res = 1;
    FOR(i, 0, SIZE(fac) - 1)
        FOR(j, 0, fac[i] - 1)
            res *= primes[i];
    while(res >= 10) {
        LL tmp = 1;
        while(res > 0) {
            tmp *= (res % 10);
            res /= 10;
        }
        res = tmp;
    }
    return res;
}

struct VectorHash {
    template <typename T>
    std::size_t operator ()(const std::vector<T>& vec) const {
        std::size_t hash_val = 0;
        for(const T& elem : vec) {
            hash_val ^= std::hash<T>()(elem) + 0x9e3779b9 + (hash_val << 6) + (hash_val >> 2);
        }
        return hash_val;
    }
};

unordered_map<VI, vector<LL>, VectorHash> DP[2];
string str;

vector<LL> add(vector<LL> a, vector<LL> b) {
    vector<LL> res;
    FOR(i, 0, SIZE(a) - 1)
        res.PB(a[i] + b[i]);
    return res;
}

VI add(VI a, VI b) {
    VI res;
    FOR(i, 0, SIZE(a) - 1)
        res.PB(a[i] + b[i]);
    return res;
}

vector<LL> calc(int pos, int ust, int started, int cnt, int zero, VI currFactors, int typ) {
    if((typ == 0 && pos == 0) || (typ && pos == str.length())) {
        vector<LL> ret(10, 0);
        ret[calc_digit(zero, cnt, currFactors)] = 1;
        return ret;
    }
    VI state = {pos, ust, started, cnt, zero};
    state.insert(state.end(), currFactors.begin(), currFactors.end());
    if(SIZE(state) != 9)
        exit(0);
    if(DP[typ].find(state) != DP[typ].end())
        return DP[typ][state];
    vector<LL> res(10, 0);
    int maxDigit = (ust ? str[pos] - '0' : 9);
    if(!typ)
        maxDigit = 9;
    FOR(digit, 0, maxDigit) {
        int newUst = (ust && (digit == maxDigit));
        int newStarted = started;
        if(!started)
            newStarted = digit > 0;
        int newCnt = cnt + (started || digit);
        int newZero = zero;
        if(!started)
            newZero = 0;
        else if(!digit)
                newZero = 1;
        VI newFactors = currFactors;
        if((!started && digit) || (started && digit && !zero) )
            newFactors = add(newFactors, factors[digit]);
        if(started && (!digit || zero))
            newFactors = {0, 0, 0, 0};

        if(typ == 0)
            res = add(res, calc(pos - 1, 0, newStarted, newCnt, newZero, newFactors, 0));
        else {
            if(digit < maxDigit)
                res = add(res, calc(str.length() - pos - 1, 0, newStarted, newCnt, newZero, newFactors, 0));
            else
                res = add(res, calc(pos + 1, newUst, newStarted, newCnt, newZero, newFactors, 1));
        }
    }

    DP[typ][state] = res;
    return res;
}

void test(){
    LL n;
    scanf("%lld", &n);
    str = to_string(n);

    vector<LL> res = calc(0, 1, 0, 0, 0, {0, 0, 0, 0}, 1);
    res[0]--;
    FOR(i, 0, 9)
        printf("%lld ", res[i]);
    printf("\n");
    DP[1].clear();
}

int main() {
	int te = 1;
	scanf("%d", &te);
	while(te--)
		test();
	return 0;
}