#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i< (n); ++i)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define fore(i, a) for(auto &i:a)
using ll = long long;
using int64 = long long;
#define DEBUG(x) cerr << #x << ": "; for (auto _ : x) cerr << _ << " "; cerr << endl;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
	IoSetup() {
		cin.tie(nullptr);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(10);
		cerr << fixed << setprecision(10);
	}
} iosetup;

template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
	os << p.first << " " << p.second;
	return os;
}

template <typename T1, typename T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
	is >> p.first >> p.second;
	return is;
}

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
	for (int i = 0; i < (int)v.size(); i++) {
		os << v[i] << (i + 1 != v.size() ? " " : "");
	}
	return os;
}

template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
	for (T& in : v) is >> in;
	return is;
}

template <typename T1, typename T2>
inline bool chmax(T1& a, T2 b) {
	return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1& a, T2 b) {
	return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
	return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
	return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T& t, const V& v) {
	t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T& t, const V& v) {
	for (auto& e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
	explicit FixPoint(F&& f) : F(std::forward<F>(f)) {}

	template <typename... Args>
		decltype(auto) operator()(Args&&... args) const {
			return F::operator()(*this, std::forward<Args>(args)...);
		}
};

template <typename F>
inline decltype(auto) MFP(F&& f) {
	return FixPoint<F>{std::forward<F>(f)};
}
int main(){
  ll t;
	cin >> t;
	while(t--){
		ll N;
		cin >> N;
		ll k = 81181819-N;
		string K = to_string(k);
		ll sz = K.size();
		vector<ll> A(sz);
		rep(i, sz){
			A[i] = k%10;
			k/=10;
		}
		ll B = 1;
		rep(_, sz-1)B*=4;
		vector<ll> res;
		ll m = 10000000;
		if(sz == 1){
			cout << A[0]/8+A[0]%8 << endl;
			rep(i, A[0]/8)cout << 8 << endl;
			rep(i, A[0]%8)cout << 1 << endl;
			continue;
		}
		rep(b, B){
			vector<ll> a = A;
		  ll bb = b;
			rep(j, sz-1){
				ll c = bb % 4;
				a[j+1] -= c;
				a[j] += 10*c;
				bb/=4;
			}
			bool flag = true;
			ll temp = 0;
			rep(j, sz){
				if(a[j] < 0){
					flag = false;
					break;
				}
				chmax(temp,a[j]/8 + a[j]%8);
			}
			if(flag && m > temp){
				res = a;
				m = temp;
			}
		}
		cout << m << "\n";
		vector<ll> ans(m, 0);
		ll ten = 1;
		rep(i, sz){
			ll idx = 0;
			ll eight = res[i]/8;
			rep(j, eight){
				ans[idx] += 8*ten;
				idx++;
			}
			ll one = res[i]%8;
			rep(j, one){
				ans[idx] += ten;
				idx++;
			}
			ten *= 10;
		}
		rep(i, m){
			cout << ans[i] << "\n";
		}
	}
}