#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#define N 200006
#define ll long long
#define p 998244353
using namespace std;

inline bool cmp(const int *f,const int *g,int n){ // f <= g
	for(int i=n-1;i>=0;--i){
		if(f[i]==g[i]) continue;
		return f[i]<g[i];
	}
	return true;
}

int a[N],b[27][N],d[27];
char str[N];
int cnt,len,blen;

int main(){
	int T,n;
	scanf("%d",&T);
	while(T--){
		cnt = n = 0;
		scanf("%s",str);
		n = strlen(str);
		for(int i=0;i<n;++i) a[i] = str[n-i-1]-'0';
		while(n>1){
			if(n==2&&a[1]==1){
				if(a[0]==0) d[cnt] = 1,b[cnt][0] = 9,a[0]++;
				else d[cnt] = 2,b[cnt][0] = b[cnt][1] = 1,a[0]--;
				a[1] = 0;
				++cnt;
				break;
			}
			blen = n;
			len = (n&1)?(n>>1)+1:n>>1;
			for(int i=0;i<len;++i) b[cnt][i] = b[cnt][n-i-1] = a[n-i-1];
			
			if(!cmp(b[cnt],a,n)){
				int pt = len;
				while(a[n-pt]==0) --pt;
				if(pt>1) b[cnt][pt-1] = b[cnt][n-pt] = a[n-pt]-1;
				else{
					blen = n-1;
					for(int i=0;i<blen;++i) b[cnt][i] = 9;
					b[cnt][n-1] = 0;
				}
			}	
			//for(int i=n-1;i>=0;--i) putchar(a[i]+'0');
			//putchar('\n');
			//for(int i=blen-1;i>=0;--i) putchar(b[cnt][i]+'0');
			//putchar('\n');
			for(int i=blen-1;i>=0;--i) a[i] -= b[cnt][i];
			for(int i=0;i<n;++i){
				if(a[i]>=0) continue;
				a[i+1]--;
				a[i] += 10;
			}
			//putchar('\n');
			//for(int i=n-1;i>=0;--i) putchar(a[i]+'0');
			//puts("\n");
			while(a[n-1]==0&&n>1) n--;
			d[cnt++] = blen;
		}
		//continue;
		printf("%d\n",cnt+(a[0]>0));
		for(int i=0;i<cnt;++i){
			for(int j=d[i]-1;j>=0;--j) putchar(b[i][j]+'0');
			putchar('\n');
		}
		if(a[0]>0) printf("%d\n",a[0]);
	}
	return 0;
}