#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define db double
#define ve vector<int>
#define pa pair<int,int>
#define fr first
#define sd second
#define pb push_back
#define mp make_pair
#define MEM(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
inline ll read()
{
	char ch = getchar();
	ll s = 0, w = 1;
	while (ch < '0' || ch > '9') {if (ch == '-')w = -1; ch = getchar();}
	while (ch >= '0' && ch <= '9') {s = s * 10 + ch - '0'; ch = getchar();}
	return s * w;
}
vector<int> operator +(vector<int>a, vector<int>b)
{
	int n = a.size(), m = b.size();
	if (n < m)swap(n, m), swap(a, b);
	FOR(i, 0, m - 1)a[i] += b[i];
	FOR(i, 0, n - 2) {a[i + 1] += a[i] / 10; a[i] %= 10;}
	while (a[n - 1] >= 10) {a.pb(a[n - 1] / 10); a[n - 1] %= 10; n++;}
	return a;
}
vector<int> operator -(vector<int>a, vector<int>b)
{
	int n = a.size(), m = b.size();
	FOR(i, 0, m - 1)a[i] -= b[i];
	FOR(i, 0, n - 1)if (a[i] < 0) {a[i + 1]--; a[i] += 10;}
	// FOR(i, 0, n - 1)cout << a[i]; cout << '\n';
	while (n && a[n - 1] == 0) {a.pop_back(); n--;}
	return a;
}
int operator <(const vector<int>a, const vector<int>b)
{
	if (a.size() > b.size())return 0;
	if (a.size() < b.size())return 1;
	int n = a.size();
	REP(i, n - 1, 0)
	{
		if (a[i] < b[i])return 1;
		if (a[i] > b[i])return 0;
	}
	return 1;
}
int check(vector<int>a)
{
	int w = -1;
		for (int x : a)if (w == -1) w = x; else if (w != x)return 0;
	return 1;
}
vector<int>summon(int x, int k)
{
	vector<int>a;
	while (k--)a.pb(x);
	return a;
}
void print(vector<int>a)
{
	reverse(a.begin(), a.end());
	int n = a.size() - 1;
	for (int x : a)cout << x; cout << ' ';
}
#define N 100010
char s[N];
void sol()
{
	scanf("%s", s);
	int n = strlen(s);
	vector<int>G;
	REP(i, n - 1, 0)G.pb(s[i] - '0');
	FOR(len, max(1, n - 1), n)FOR(x, 1, 9)
	{
		vector<int>tmp = summon(x, len);
		// if (len == 1 && x == 1)
		// {
		// 	cout << (tmp < G) << ' '; print(G - tmp);
		// }
		if (tmp < G && check(G - tmp))
		{
			print(tmp);
			print(G - tmp); cout << '\n';
			return ;
		}
	}
	exit(-1);
}
signed main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	int T = read();
	while (T--)sol();
	return 0;
}