#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int ttt;
	cin>>ttt;
	auto f=[](ll x)->ll{
		if(x==0)return 0;
		string s=to_string(x);
		int n=s.size();
		vector<ll> dp(20);
		dp[0]=1;
		for(int i=0;i<n;i++){
			vector<ll> ndp(20);
			for(int j=0;j<20;j++){
				int x=j/10,y=j%10;
				for(int d=0;d<10;d++){
					if(d<s[i]-'0'){
						ndp[10+max(y,d)]+=dp[j];
					}else if(d==s[i]-'0'){
						ndp[x*10+max(y,d)]+=dp[j];
					}else{
						if(x==1)ndp[10+max(y,d)]+=dp[j];
					}
				}
			}
			dp=ndp;
		}
		ll res=0;
		for(int i=0;i<20;i++)res+=(i%10)*dp[i];
		return res;
				
	};
	vector<pair<ll,ll>> v(101,make_pair(-1,-1));
	for(int i=1;i<=100;i++){
		for(int j=1;j<=10000;j++){
			int sum=0;
			for(int k=j;k<=j+i;k++){
				int d=0;
				int x=k;
				while(x>0){
					d=max(d,x%10);
					x/=10;
				}
				sum+=d;
				if(sum==i){
					v[i]=make_pair(j,k);
					break;
				}
				if(sum>i)break;
			}
			if(v[i].first!=-1)break;
		}
	}
	while(ttt--){
		ll n;
		cin>>n;

		if(n<=100){
			cout<<v[n].first<<" "<<v[n].second<<endl;
			//cout<<f(v[n].second)<<" "<<f(v[n].first-1)<<endl;
			continue;
		}
		ll x=888888888888888889;
		ll r=x+((n+8)/9)-1;
		x-=(9-n%9)%9;r-=(9-n%9)%9;
		cout<<x<<" "<<r<<endl;
	}
}