#include<bits/stdc++.h>
using namespace std;
#define int long long
#define PII pair<int,int>
const int N=2e5+10;
const int mod=1e9+7;
const int INF=1e9;

string s; 
int len; 
int a[N],b[N],c[N];
string ansa,ansb; 

bool fun2(string str1,string str2){			//s1-s2

	for(int i=0;i<N;i++)a[i]=b[i]=c[i]=0;
    if (str1<str2&&str1.size() == str2.size()){
        return false;
    }
    for (int i = 0; i < str1.size(); i ++)
        a[str1.size()-1-i] = str1[i] - '0';
    for (int i = 0; i < str2.size(); i ++)
        b[str2.size()-i-1] = str2[i] - '0';
        
    int ans = max(str1.size(), str2.size());
    for (int i = 0; i < ans; i ++){
        if (a[i] < b[i]){
            a[i+1] -= 1; // 向前位借一位
            a[i] += 10;  // 后一位就得加10
        }
		c[i] = a[i] - b[i];  // 之后就是正常减法了
//		cout<<i<<" "<<a[i]<<" "<<b[i]<<" "<<c[i]<<endl;
		if(i&&c[i]!=c[i-1]&&c[i]){
			return false;			//提前中断,前导0不能作为判断条件 
		}
    }
    while (c[ans-1] == 0 && ans > 1)ans -= 1; 
    
    if(ans==1&&!c[0])return false;
    
    for (int i = 1; i < ans; i ++){
    		if(c[i]!=c[i-1]){
    			return false;
		} 
	}
	
    for (int i = 0; i < ans; i ++){
    	ansb+=('0'+c[ans-1-i]);
	}    
	return true;
} 

bool fun1(int l,int x){		//预处理 
	ansa="";
	ansb="";
	string t;
	char c='0'+x; 
	for(int i=0;i<l;i++){
		t+=c;
	}
	
	ansa=t;
	//做一下高精度减法,s-t 
	int flag=fun2(s,t);
	if(!flag)return false;
	else {
		return true;
	}
}



void solve(){
	cin>>s;
	len=s.length();
	

	//1.枚举a的长度要么一样，要么小1，2.枚举数字1--9
	for(int i=len;i>=len-1;i--){
		for(int j=9;j>=1;j--){
			if(fun1(i,j)){
				cout<<ansa<<" "<<ansb<<endl;
				return;
			}
		}	
	} 
	
	
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int T=1;
	cin>>T;
	while(T--) {
		solve();
	}
}