#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 hoge2(ll v) {
	int ma=0;
	while(v) ma=max(ma,(int)(v%10)),v/=10;
	return ma;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	
	cin>>T;
	while(T--) {
		cin>>N;
		if(N<100) {
			ll R=0;
			ll L=0;
			ll U=0;
			while(1) {
				while(U>N) U-=hoge2(L++);
				if(U==N) break;
				U+=hoge2(++R);
			}
			cout<<L<<" "<<R<<endl;
		}
		else {
			ll a=8888888888888888889LL;
			ll a9=(N+8)/9;
			ll a8=9*a9-N;
			a9-=a8;
			assert(a8*8+a9*9==N);
			ll L=a-a8;
			ll R=a+(a9-1);
			cout<<L<<" "<<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;
}