#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define int long long

void solve() {
    int n, m;
    cin >> n >> m;
    string c; cin >> c;
    int len = (int)c.size();
    vector<int> C(len + 1);
    for(int i = 1;i <= len;i++) {
        C[i] = c[i - 1] - '0';
    }
    auto check = [&] (int l, int r, int x) {
        int tmp = 0;
        for(int i = l;i <= r;i++) tmp = tmp * 10 + C[i];
        return x == tmp;
    };
    auto calc = [&] (int x) {
        array<vector<int>, 2> res{};
        vector<int> A(n + 1), B(m + 1);
        A[1] = x;
        int i = 1;
        for(int j = 1;j <= m;j++) {
            if(i > len) return res;
            int tmp = C[i];
            if(tmp < x) {
                if(tmp == 0) {
                    B[j] = 0;
                    i++;
                    continue;
                }
                if(i == len) return res;
                tmp = tmp * 10 + C[i + 1];
                if(tmp % x) return res;
                B[j] = tmp / x;
                i += 2;
            }
            else {
                if(tmp % x) return res;
                B[j] = tmp / x;
                i++;
            }
        }
//        for(int j = 1;j <= m;j++) cout << B[j];
//        cout << endl;
//        cout << i << endl;
        for(int k = 2;k <= n;k++) {
//            cout << i << endl;
            if(i > len) return res;
            int tmp = C[i];
            if(tmp < B[1]) {
                if(tmp == 0) {
                    A[k] = 0;
                    i++;
                }
                else {
                    if(i == len) return res;
                    tmp = tmp * 10 + C[i + 1];
                    if(tmp % B[1]) return res;
                    A[k] = tmp / B[1];
//                cout << tmp << " " << x << " " << A[k] << endl;
                    i += 2;
                }
            }
            else {
                if(tmp % B[1]) return res;
                A[k] = tmp / B[1];
                i++;
            }
//            cout << "k = " << k << " " << A[k] << " " << i << endl;
            for(int j = 2;j <= m;j++) {
                if(i > len) return res;
                int now = B[j] * A[k];
//                cout << "now = " << now << " " << i << endl;
                if(now < 10) {
                    if(check(i, i, now)) i++;
                    else return res;
                }
                else {
                    if(i == len) return res;
                    if(check(i, i + 1, now)) i += 2;
                    else return res;
                }
            }
//            cout << "i = " << i << "number = " << A[k] << endl;
        }
        if(i <= len) return res;
        res[0] = A, res[1] = B;
        return res;
    };
//    calc(1);
    for(int i = 1;i <= 9;i++) {
        auto ans = calc(i);
        if((int)ans[0].size() > 0) {
            for(int j = 1;j <= n;j++) cout << ans[0][j];
            cout << " ";
            for(int j = 1;j <= m;j++) cout << ans[1][j];
            cout << endl;
            return;
        }
    }
    cout << "Impossible" << endl;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}