#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=501000;
char s[N];
int c[N];
void solve() {
	scanf("%s",s);
	int len=strlen(s);
	VI dig;
	dig.pb(len);
	if (len>1) dig.pb(len-1);
	for (auto d:dig) rep(n,1,10) {
		rep(i,0,len) c[i]=s[i]-'0';
		c[len]=0;
		reverse(c,c+len);
		rep(i,0,d) c[i]-=n;
		rep(i,0,len) {
			if (c[i]<0) c[i]+=10,c[i+1]-=1;
		}
		if (c[len]<0) {
			continue;
		}
		int x=len-1;
		while (x>=0&&c[x]==0) --x;
		if (x<0) {
			continue;
		}
		//printf("%d %d %d\n",d,n,len);
		bool sm=1;
		rep(i,0,x+1) sm&=c[i]==c[0];
		if (sm) {
			rep(i,0,d) printf("%d",n); putchar(' ');
			rep(i,0,x+1) printf("%d",c[0]); puts("");
			return;
		}
	}
}

int _;
int main() {
	for (scanf("%d",&_);_;_--) {
		solve();
	}
}