#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T;
ll N;
ll V;
ll dp[20][10][2];
ll p10[19];

ll dfs(int d,int ma,int le) {
	if(d<0) return ma;
	if(dp[d][ma][le]>=0) return dp[d][ma][le];
	ll ret=0;
	int i;
	int v=V/p10[d]%10;
	FOR(i,10) {
		if(le==0&&i>v) continue;
		ret+=dfs(d-1,max(ma,i),le|(i<v));
	}
	return dp[d][ma][le]=ret;
	
}

map<ll,ll> M;

ll hoge(ll v) {
	if(M.count(v)) return M[v];
	
	V=v;
	MINUS(dp);
	return M[v]=dfs(18,0,0);
}


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	p10[0]=1;
	FOR(i,18) p10[i+1]=p10[i]*10;
	
	cin>>T;
	while(T--) {
		cin>>N;
		ll R=1LL<<57;
		for(i=56;i>=0;i--) if(hoge(R-(1LL<<i))>=N) R-=1LL<<i;
		ll L=0;
		while(1) {
			while(hoge(R)-hoge(L)>N) L++;
			if(hoge(R)-hoge(L)==N) break;
			R++;
		}
		
		cout<<L+1<<" "<<R<<endl;
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}