#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

vector<ll> dfs(map<ll, vector<ll>> &memo, ll k, ll now, map<pll, vector<ll>> &mp){
    // メモ化再帰
    if (now == 0){
        vector<ll> vec(k, 0);
        return vec;
    }
    else if (memo.find(now) != memo.end()){
        return memo[now];
    }
    for (ll i = 0; i < 80; i++){
        if (mp.find(make_pair(k, i)) != mp.end() && now >= i && (now - i) % 10 == 0){
            vector<ll> vec = dfs(memo, k, (now - i) / 10, mp);
            if (vec[0] == -1){
                continue;
            }
            for (ll j = 0; j < k; j++){
                vec[j] = vec[j] * 10 + mp[make_pair(k, i)][j];
            }
            memo[now] = vec;
            return vec;
        }
    }
    vector<ll> game_over(k, -1);
    return memo[now] = game_over;
}

int main(){
    // 最初に数とそれを実現する組を全列挙しておく
    vector<ll> unit = {0, 1, 8};
    map<pll, vector<ll>> mp;
    mp[make_pair(1, 0)] = {0};
    mp[make_pair(1, 1)] = {1};
    mp[make_pair(1, 8)] = {8};
    for (ll i = 1; i < 10; i++){
        for (ll j = 0; j <= 80; j++){
            if (mp.find(make_pair(i, j)) == mp.end()){
                continue;
            }
            vector<ll> vec = mp[make_pair(i, j)];
            for (ll k = 0; k < 3; k++){
                vec.push_back(unit[k]);
                if (mp.find(make_pair(i + 1, j + unit[k])) == mp.end()){
                    mp[make_pair(i + 1, j + unit[k])] = vec;
                }
                vec.pop_back();
            }
        }
    }
    ll T;
    cin >> T;
    while (T--){
        ll N;
        cin >> N;
        N = 81181819 - N;

        // 10 個以内で可能ではある
        for (ll i = 1; i <= 10; i++){
            map<ll, vector<ll>> memo;
            vector<ll> ans = dfs(memo, i, N, mp);
            if (ans[0] != -1){
                cout << i << endl;
                for (ll j = 0; j < i; j++){
                    cout << ans[j] << endl;
                }
                break;
            }
        }
    }   
}