#include<bits/stdc++.h>
using namespace std;

#define rep(i, a, n) for(int i=(a); i<(n); ++i)
#define per(i, a, n) for(int i=(a); i>(n); --i)
#define pb emplace_back
#define mp make_pair
#define clr(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(),(x).end()
#define lowbit(x) (x & -x)
#define fi first
#define se second
#define lson o<<1
#define rson o<<1|1
#define gmid l[o]+r[o]>>1

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll, ll>;
using vi = vector<int>;

constexpr int mod = 998244353;
constexpr int inf = 0x3f3f3f3f;
constexpr int N = 4010;

int T, len, n[N], a[N], b[N];
char s[N];

bool ok(){
  bool flag = 0;
  per(i, len-1, -1){
    if(n[i] != a[i]){
      if(n[i] < a[i]) return 0;
      flag = 1;
      break;
    }
  }
  if(!flag) return 0;
  b[len] = 0;
  rep(i, 0, len)  b[i] = n[i] - a[i];
  rep(i, 0, len){
    if(b[i] < 0){
      b[i] += 10;
      b[i+1] -= 1;
    }
  }
  int m = len - 1;
  while(b[m] == 0)  --m;
  rep(i, 1, m + 1){
    if(b[i] != b[0])  return 0;
  }
  return 1;
}

void solve(){
  len = strlen(s);
  rep(i, 0, len)  n[len - i - 1] = s[i] - '0';

  rep(v, 1, 10){
    rep(j, 0, len)  a[j] = v;
    if(ok()){
      return;
    }
    a[len - 1] = 0;
    if(ok()){
      return;
    }
  }
}

void output(int *x, char ch){
  int i = len-1;
  for(; i>0; --i)  if(x[i])  break;
  for(; i>=0; --i)  cout << x[i];
  cout << ch;
}

void _main(){
  cin >> T;
  while(T--){
    cin >> s;
    solve();
    output(a, ' ');
    output(b, '\n');
  }
}

int main(){
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  _main();
  return 0;
}