#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define ll long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define repl(i,a,b) for(ll i=(a);i<(b);i++)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

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 solve(){
  // set<int> st;
  // rep(i,0,20)rep(j,0,20){
  //   st.insert(8*i+9*j);
  // }
  // rep(i,0,200)if(!st.count(i)) cout << i << "\n";
  
  
  ll n; cin >> n;
  auto f=[](int x) -> int{
    int res=0;
    while(x){
      chmax(res,x%10);
      x/=10;
    }
    return res;
  };
  if(n<=55){
    rep(j,2,60)rep(i,1,j+1){
      ll sum=0;
      rep(k,i,j+1) sum+=f(k);
      if(sum == n){
        cout << i << " " << j << "\n";
        return;
      }
    }
  }

  ll a=(9-n%9)%9;
  ll b=(n-8*a)/9;
  ll mid=8;
  rep(i,0,17){
    mid*=10;
    mid+=8;
  }

  cout << mid-a+1 << " " << mid+b << "\n";
  

  return;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int T=1;
  cin >> T;
  while(T--) solve();
}