#include <bits/stdc++.h>

using namespace std;
vector <string> d[10];
bool comp(const string &s1, const string &s2){
    int l1 = s1.size(), l2 = s2.size();
    if(l1 != l2) return l1 < l2;
    while(l1--){
        if(s1[l1] != s2[l1]) return s1[l1] < s2[l1];
    }
    return 0;
}
inline void print(const string &s2){
    for(int i = s2.size() - 1; i >= 0; i--) cout << s2[i];
}
bitset <10> f;
bool subtract(string a, const string &b){
    int n = a.size(), m = b.size(),t = 0,x;
    for(int i = 0; i < n; i++){
        if(i < m) x = (a[i] - b[i]) + t;
        else x = a[i] - '0' + t;
        if(x < 0){
            x += 10;
            t = -1;
        }
        else t = 0;
        a[i] = x + '0';
    }
    f.reset();
    while(n > 1 && a[n - 1] == '0'){
        a.pop_back();
        n--;
    }
    t = 0;
    for(int i = a.size() - 1; i >= 0; i--) f[(a[i] - 48)] = 1;
    if(f[0]) return 0;
    for(int i = 1; i <= 9; i++) if(f[i]) t++;
    if(t != 1) return 0;
    print(a);
    cout << " ";
    print(b);
    cout << "\n";
    return 1;
}
void process(string &s){
    int l = s.size(),i;
    while(l){
        for(i = 1; i < 10; i++)
            if(!comp(d[i][l],s)) break;
        i--;
        if(i && subtract(s,d[i][l])) return;
        l--;
    }
}
int main()
{
    int n,i,t;
    string s;
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    for(i = 1; i < 10; i++) d[i].push_back("");
    for(i = 1; i <= 4000; i++)
        for(int j = 1; j < 10; j++) d[j].push_back(d[j][i - 1] + char('0' + j));
    cin >> t;
    for(int e = 1; e <= t; e++){
        cin.get();
        cin >> s;
        reverse(s.begin(), s.end());
        process(s);
    }
    return 0;
}