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

const int N = 2e6 + 5;

int T;
int n, m;
int c[N];
int a[N], b[N];

signed main()
{
    ios::sync_with_stdio(false);
#ifdef DEBUG
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    // Don't stop. Don't hide. Follow the light, and you'll find tomorrow.

    cin >> T;
    while (T--)
    {
        string s;
        cin >> n >> m;
        cin >> s;
        int l = s.length();
        s = " " + s;
        for (int i = 1; i <= l; i++)
            c[i] = s[i] - '0';
        bool flag_c = false;
        for (a[1] = 1; a[1] <= 9; a[1]++)
        {
            memset(b, 0, (m + 5) * sizeof(b[0]));
            bool flag_a1 = true;
            int c_tot = 0;
            for (int j = 1; j <= m; j++)
            {
                if (((c[c_tot + 1] % a[1]) != 0) &&
                    ((c_tot == l - 1) || ((((c[c_tot + 1] * 10 + c[c_tot + 2]) % a[1]) != 0) ||
                                          ((((c[c_tot + 1] * 10 + c[c_tot + 2]) / a[1]) > 9)))))
                {
                    flag_a1 = false;
                    break;
                }
                if (c[c_tot + 1] % a[1] == 0)
                {
                    b[j] = c[c_tot + 1] / a[1];
                    c_tot++;
                }
                else
                {
                    b[j] = (c[c_tot + 1] * 10 + c[c_tot + 2]) / a[1];
                    c_tot += 2;
                    // cout << '!' << endl;
                }
            }
            if (!flag_a1 || b[1] == 0)
                continue;
            bool flag_a = true;
            // cout << c_tot << endl;
            for (int i = 2; i <= n; i++)
            {
                // cout << c_tot << endl;
                if (((c[c_tot + 1] % b[1]) != 0) &&
                    ((c_tot == l - 1) || ((((c[c_tot + 1] * 10 + c[c_tot + 2]) % b[1]) != 0) ||
                                          ((((c[c_tot + 1] * 10 + c[c_tot + 2]) / b[1]) > 9)))))
                {
                    flag_a = false;
                    break;
                }
                if (c[c_tot + 1] % b[1] == 0)
                {
                    a[i] = c[c_tot + 1] / b[1];
                    c_tot++;
                }
                else
                {
                    a[i] = (c[c_tot + 1] * 10 + c[c_tot + 2]) / b[1];
                    c_tot += 2;
                    // cout << '!' << endl;
                }
                for (int j = 2; j <= m; j++)
                {
                    // cout << i << ' ' << j << ' ' << c_tot << endl;
                    if ((a[i] * b[j] != c[c_tot + 1]) && (a[i] * b[j] != c[c_tot + 1] * 10 + c[c_tot + 2]))
                    {
                        // cout << c_tot << ' ' << i << ' ' << j << ' ' << a[i] << ' ' << b[j] << endl;
                        flag_a = false;
                        break;
                    }
                    if ((a[i] * b[j] == c[c_tot + 1]))
                        c_tot++;
                    else if (a[i] * b[j] == c[c_tot + 1] * 10 + c[c_tot + 2])
                        c_tot += 2;
                }
            }
            // for (int i = 1; i <= n; i++)
            //     cout << a[i] << " \n"[i == n];
            if (!flag_a || c_tot != l)
                continue;
            flag_c = true;
            break;
        }
        if (!flag_c)
            cout << "Impossible" << endl;
        else
        {
            for (int i = 1; i <= n; i++)
                cout << a[i];
            cout << ' ';
            for (int j = 1; j <= m; j++)
                cout << b[j];
            cout << endl;
        }
    }

    return 0;
}