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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  // get x-y
  auto sub = [&](string x, string y)->string {
	  reverse(all(x));
	  reverse(all(y));
	  bool need_carry = false;
	  string res;
	  rep(i, 0, sz(x)) {
		  int a = x[i] - '0';
		  int b = i < sz(y) ? y[i] - '0' : 0;
		  if (need_carry) {
			  if (a == 0) {
				  need_carry = true;
				  a = 9;
			  } else {
				  need_carry = false;
				  a--;
			  }
		  }
		  if (a >= b) {
			  res.push_back((a-b) + '0');
		  } else {
			  need_carry = true;
			  a += 10;
			  res.push_back((a-b) + '0');
		  }
	  }
	  while(res.back() == '0') res.pop_back();
	  reverse(all(res));
	  return res;
  };

  int tt;
  cin >> tt;
  while(tt--) {
	  string N;
	  cin >> N;
	  int n = sz(N);

	  bool ok =false;
	  rep(d, 1, 10) {
		  char c = '0' + d;

		  // Same length
		  string S(n, c);
		  if (S < N) {
			  auto res = sub(N, S);
			  if (count(all(res), res[0]) == sz(res)) {
				  cout << S << " " << res << '\n';
				  ok = true;
				  break;
			  }
		  }

		  // One less
		  if (n >= 1)  {
			  string S(n-1, c);
			  auto res = sub(N, S);
			  if (count(all(res), res[0]) == sz(res)) {
				  cout << S << " " << res << '\n';
				  ok = true;
				  break;
			  }
		  }
	  }
	  if (ok) continue;
	  assert(false);
  }
}