#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}



void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll N;
    cin >> N;
    N = 81181819 - N;
    ll L = 0, R = 80;

    auto f = [&](ll M) -> vector<ll> {
        const int X = 2000;
        vector<vector<ll>> p(X);
        vector<ll> q;
        const int D = 8;
        vector<ll> A;
        {
            ll tmp = N;
            rep(i, 0, D){
                A.push_back(tmp % 10);
                tmp /= 10;
            }
        }
        rep(i, 0, M + 1) rep(j, i, M + 1){
            int val = (j - i) * 1 + (M - j) * 8;
            if (p[val].empty()){
                rep(a, 0, i) p[val].push_back(0);
                rep(a, i, j) p[val].push_back(1);
                rep(a, j, M) p[val].push_back(8);
                q.push_back(val);
            }
        }
        vector dp(D + 1, vector<int>(X, -1));
        dp[0][0] = 0;
        rep(d, 0, D){
            rep(i, 0, X){
                if (dp[d][i] == -1) continue;
                for (auto a : q){
                    int nx = (i + a);
                    if (nx % 10 != A[d]) continue;
                    nx /= 10;
                    dp[d + 1][nx] = a;
                }
            }
        }
        if (dp[D][0] == -1) return {};
        vector<ll> res(M);
        int ind = 0;
        for (int d = D - 1; d >= 0; d--){
            int nx = dp[d + 1][ind];
            // cout << nx << " " << ind << " " << A[d] << endl;
            rep(i, 0, M){
                res[i] *= 10;
                res[i] += p[nx][i];
            }
            ind *= 10;
            ind += A[d];
            ind -= nx;
        }
        return res;
    };
    while (R - L > 1){
        ll M = (L + R) / 2;
        if (f(M).empty()) L = M;
        else R = M;
    }
    cout << R << "\n";
    auto ans = f(R);
    for (auto x : ans){
        cout << x << "\n";
    }
}