#include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
#include<assert.h>
#define RI register int
#define CI const int&
using namespace std;
const int N=4005;
int t,n; string s;
int main()
{
	ios::sync_with_stdio(false); cin.tie(0);
	for (cin>>t;t;--t)
	{
		auto sub=[&](string A,string B)
		{
			reverse(A.begin(),A.end());
			reverse(B.begin(),B.end());
			static int tmp[N]; int c=0;
			for (RI i=0;i<A.size();++i)
			{
				int res=A[i]-(i<B.size()?B[i]:'0')-c;
				if (res<0) res+=10,c=1; else c=0;
				tmp[i]=res;
			}
			int len=A.size()-1;
			while (tmp[len]==0) --len;
			string C; for (RI i=len;i>=0;--i) C+=tmp[i]+'0';
			return C;
		};
		RI i; cin>>s; string A(s.size(),s[0]);
		if (A<s)
		{
			string B=sub(s,A); bool flag=1;
			for (i=1;i<B.size();++i)
			if (B[i]!=B[0]) { flag=0; break; }
			if (flag) { cout<<A<<' '<<B<<endl; continue; }
		}
		if (s[0]>='2') A=string(s.size(),s[0]-1);
		else A=string(s.size()-1,'9');
		string B=sub(s,A); bool flag=1;
		for (i=1;i<B.size();++i)
		if (B[i]!=B[0]) { flag=0; break; }
		if (flag) { cout<<A<<' '<<B<<endl; continue; }
		assert(0);
	}
	return 0;
}