#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef tuple<int, int, int> tii;
typedef tuple<ll, ll, ll> tll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define nl "\n"
#define all(v) v.begin(),v.end()
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define sz(x) (int)(x).size()

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); 
const int maxn = 1e6 + 5;

ll n, m, q, k, t, a, b, c;

string sub(string a, string b) {
	int carry = 0;
	string ans = "";
	for (int i = 0; i < a.size(); i++) {
		int i1 = (int) a.size() - 1 - i;
		int i2 = (int) b.size() - 1 - i;
		int x = a[i1] - '0';
		int y = 0;
		if (i2 >= 0) {
			y = b[i2] - '0';
		}
		y += carry;
		if (y > x) {
			x += 10;
			carry = 1;
		} else {
			carry = 0;
		}
		
		int c = x - y;
		char c1 = c + '0';
		ans += c1;
	}
	return ans;
}

string rm(string a) {
	while (a.size() > 0 && a.back() == '0') a.pop_back();
	return a;
}

bool check(string a) {
	while (a.size() > 0 && a.back() == '0') a.pop_back();
	if (a.size() == 0) return false;
	char c = a[0];
	for (int i = 1; i < a.size(); i++) {
		if (c != a[i]) return false;
	}
	return true;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> t;
	while (t--) {
		string n;
		cin >> n;
		int x = n[0] - '0';
		bool ok = true;
		bool gd = false;
		for (int i = 1; i < n.size(); i++) {
			int y = n[i] - '0';
			if (y > x) gd = true;
			if (y < x && !gd) ok = false;
		}
		string ans1, ans2;
		for (int i = 1; i <= 9; i++) {
			string cm = "";
			if (i < x || (i == x && ok)) {
				char c = i + '0';
				for (int j = 0; j < n.size(); j++) {
					cm += c;
				}
			} else {
				char c = i + '0';
				for (int j = 0; j < n.size() - 1; j++) {
					cm += c;
				}
			}
			string c2 = sub(n, cm);
			if (check(c2)) {
				ans1 = cm;
				ans2 = c2;
				break;
			}
		}
		cout << ans1 << " " << rm(ans2) << nl;
	}
}