#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>   
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;   
using namespace std;
#define ll long long
#define ld long double
#define nline "\n"
#define f first
#define s second
#define sz(x) (ll)x.size()
#define vl vector<ll>
const ll INF_MUL=1e13;
const ll INF_ADD=1e18;
#define all(x) x.begin(),x.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
//--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------     
const ll MOD=998244353;
const ll MAX=200200;
string getv(string x,string y){
  ll need=0;
  string z;
  while(sz(y)<sz(x)){
    y.insert(y.begin(),'0');
  }
  if(sz(x)<sz(y) or (x==y)){
    return z;
  }
  while(!x.empty()){
    auto l=x.back()-'0',r=y.back()-'0';
    x.pop_back(); y.pop_back();
    l-=need;
    if(l<r){
      l+=10;
      need=1;
    }
    else{
      need=0;
    }
    z.push_back('0'+l-r);
  }
  while(!z.empty() and z.back()=='0'){
    z.pop_back();
  }
  if(need){
    z.clear();
  }
  return z;
}
void solve(){ 
  string s; cin>>s;
  string l=s;
  for(char i='1';i<=s[0];i++){
    for(auto &it:l){
      it=i;
    }
    string r=getv(s,l);
    if(!r.empty()){
      sort(all(r));
      if(r[0]==r.back()){
        cout<<l<<" "<<r<<nline;
        return;
      }
    }
  }
  l.pop_back();
  for(char i='1';i<='9';i++){
    for(auto &it:l){
      it=i;
    }
    string r=getv(s,l);
    if(!r.empty()){
      sort(all(r));
      if(r[0]==r.back()){
        cout<<l<<" "<<r<<nline;
        return;
      }
    }
  }
  assert(0);
  return;    
}  
int main()                                                                                 
{         
  ios_base::sync_with_stdio(false);                         
  cin.tie(NULL);                              
  ll test_cases=1;                 
  cin>>test_cases;
  while(test_cases--){
    solve();
  }
  cout<<fixed<<setprecision(12);  
  cerr<<"Time:"<<1000*((double)clock())/(double)CLOCKS_PER_SEC<<"ms\n"; 
}