#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define Yes cout << "Yes" << "\n"
#define No cout << "No" << "\n"
#define rtr0 return(0)
#define all(x) x.begin(), x.end()
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
//using mint=static_modint<998244353>;
//using mint=static_modint<1000000007>;
////using mint=modint;
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
using ll=long long;
using l3=__int128;
using ull=unsigned long long;
using ld=long double;
using P=pair<ll,ll>;
const ld PI=acos(-1);
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
void yn(bool f){cout<<(f?"Yes":"No")<<endl;}
const vector<int> dx={1,0,-1,0};
const vector<int> dy={0,1,0,-1};
const int inf=1001001001;
const ll INF=1001001001001001001;
ll mod=998244353;

vector<ll> a(1010,0);
map<ll,P> mp;

void solve(){
    ll n;cin>>n;

    if(n<=100){
        if(mp.count(n)){
            cout<<mp[n].first<<" "<<mp[n].second<<endl;
            return;
        }
        for(int i=1;i<=1000;i++)for(int j=1;j<=i;j++){
            if(a[i]-a[j-1]==n){
                cout<<j<<" "<<i<<endl;
                mp[n]={j,i};
                return;
            }
        }
    }
    ll a=n/9;
    ll b=n%9;
    if(b!=0)b-=9;

    ll x=111111111111111111*8+1;
    ll l=x+b;
    x--;
    ll r=x+(a-b);
    cout<<l<<" "<<r<<endl;
}

int main(){
    for(int i=1;i<=1000;i++){
        ll ma=-1;
        string s=to_string(i);
        rep(j,s.size())chmax(ma,ll(s[j]-'0'));
        a[i]=a[i-1]+ma;
    }
    ll t=1;
    cin>>t;
    rep(i,t)solve();
}