#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1000005;

int ac,a[N],c[N];
string b;
int n,m;

pair <string,bool> calc(int x,int len){
    string ret = "";
    int cur = 1;
    for(int i = 1;i <= len;i ++){
        int now = a[cur];
        if(a[cur] < x && a[cur] != 0){
            now = a[cur] * 10 + a[cur + 1];
            cur ++;
        }
        if(now % x) return make_pair(ret,0);
        ret += (char)('0' + (now / x));
        cur ++;
    }
    return make_pair(ret,1);
}

pair <string,bool> calc2(string t){
    string ret = "";
    for(int i = 0;i < n;i ++) ret += '0';
    int cur = 1;
    for(int i = 0;i < n;i ++){
        for(int j = 0;j < m;j ++){
            int x = t[j] - '0',now = a[cur];
            if(a[cur] < x && a[cur] != 0){
                now = a[cur] * 10 + a[cur + 1];
                cur ++;
            }
            if((x == 0 && now != 0) || (x != 0 && now % x)) return make_pair(ret,0);
            if(j == 0) ret[i] = (now / x) + '0'; // x != 0
            else if(x != 0 && now / x != ret[i] - '0') return make_pair(ret,0);
            cur ++;
        }
    }
    return make_pair(ret,1);
}

bool chk(string &s,string &t){
    int cc = 0;
    for(int i = 0;i < n;i ++){
        for(int j = 0;j < m;j ++){
            int x = (s[i] - '0') * (t[j] - '0');
            if(x >= 10) c[++ cc] = 1;
            c[++ cc] = x % 10;
        }
    }
    if(cc != ac) return 0;
    for(int i = 1;i <= ac;i ++) if(c[i] != a[i]) return 0;
    return 1;
}

void solve(){
    cin >> n >> m;
    cin >> b;
    for(int i = 0;i < b.length();i ++) a[i + 1] = b[i] - '0';
    ac = b.length();
    for(int i = 1;i < 10;i ++){
        auto [t,tc] = calc(i,m);
        if(!tc) continue;
        auto [s,sc] = calc2(t);
        if(!sc) continue;
        if(chk(s,t)){
            cout << s << ' ' << t << '\n';
            return;
        }
    }
    cout << "Impossible" << '\n';
}

int main(){
    ios::sync_with_stdio(false);
    int TC;
    cin >> TC;
    while(TC --){
        solve();
    }
    return 0;
}