#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
const int N = 200010;
typedef pair<int, int> PII;
int n, m;
int now;
string s;
int len;
int a[N], b[N];
int get(int x)
{
    if (now > len)
        return -1;
    int t = s[now] - '0';
    
    if (t % x == 0)
    {
        now++;
        return t / x;
    }
    t = t * 10 + (s[now + 1] - '0');
    if (now < len && t % x == 0)
    {
        now += 2;
        return t / x;
    }
    return -1;
}
bool check(int x)
{
    a[1] = x;
    now = 1;
    for (int i = 1; i <= m; i++)
    {
        b[i] = get(x);
        if (b[i] < 0)
            return false;
    }
    if (b[1] == 0)
        return false;
    /*if (x == 2)
    {
        for (int i = 1; i <= m; i++)
        {
            cout << b[i];
        }
        cout << endl;
    }*/
    for (int i = 2; i <= n; i++)
    {
        a[i] = get(b[1]);
        if (a[i] < 0)
            return false;
        for (int j = 2; j <= m; j++)
        {
            int t = a[i] * b[j];
            int l = 1;
            if (t >= 10)
                l = 2;
            for (int k = l - 1; k >= 0; k--)
            {
                if (now + k > len || s[now + k] - '0' != t % 10)
                    return false;
                t /= 10;
            }
            now += l;
            if (now > len + 1)
                return false;
        }
    }
    // cout << now << endl;
    return now == len + 1;
}
void solve()
{
    cin >> n >> m;
    cin >> s;
    len = s.size();
    s = ' ' + s;
    for (int i = 1; i <= 9; i++)
    {
        if (check(i))
        {
            for (int j = 1; j <= n; j++)
            {
                cout << a[j];
            }
            cout << " ";
            for (int j = 1; j <= m; j++)
            {
                cout << b[j];
            }
            cout << endl;
            return;
        }
    }
    cout << "Impossible" << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--)
    {
        solve();
    }
    return 0;
}