#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPL(i,j, n) for (int i = (j); i < (n); i++)
typedef vector<int> vi;
typedef vector<vi> vvi;

int getseq(int val, vi &B, vi &reference, int starting) {
    int mxs = reference.size();
    int curidx = starting;
    for (auto x: B) {
        int gg = x*val;

        if (gg < 10) {
            if (curidx >= mxs) return -1;
            if (reference[curidx] != gg) return -1;
            curidx++;
        } else {
            int t1 = gg/10;
            int t2 = gg%10;
            if (curidx+1 >= mxs) return -1;
            if (reference[curidx] != t1 || reference[curidx+1] != t2) return -1;
            curidx+=2;
        }
    }
    return curidx;
}
void printarr(vi arr) {
    for (auto x: arr) {
        cout<<x;
    }cout<<"...\n";
}
void solve() {
    int n,m;cin>>n>>m;
    string cstr;
    vi carr;

    cin>>cstr;
     for (auto x: cstr) {
        carr.push_back(x - '0');
    }
    int len = cstr.size();
    REPL(adig, 1, 10) {
        int currentplace = 0;
        bool good = true;
        vi possibleB;
        REP(_, m) {
            if (currentplace >= len) {
                good = false;break;
            }
            int nxtval;
            if (carr[currentplace] >= adig || carr[currentplace] == 0) {
                nxtval = carr[currentplace];
                currentplace++;
            } else {
                if (currentplace + 1 >= len) {
                    good = false;break;
                }
                nxtval = carr[currentplace] *10 + carr[currentplace + 1];
                currentplace+=2;
            }
            if (nxtval%adig!= 0) {
                good = false;break;
            }
            possibleB.push_back(nxtval/adig);
        }
       // cout<<adig<<"..\n";
       // printarr(possibleB);
       // cout<<good<<"..\n";
        if (!good) continue;
        vi curA = {adig};
        REP(i, n-1) {
            bool found = false;
            REP(ndig, 10) {
                int nxtidx = getseq(ndig, possibleB, carr, currentplace);
                if (nxtidx != -1) {
                    found = true;
                    currentplace = nxtidx;
                    curA.push_back(ndig);break;
                }
            }
            if (!found) {
                break;
            }
        }
      //  printarr(curA);
        if (curA.size() == n && currentplace == len) {
            for (auto x: curA) {
                cout<<x;
            }cout<<" ";
            for (auto x: possibleB) {
                cout<<x;
            }
            cout<<"\n";return;
        }
    }
    cout<<"Impossible\n";

}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t; cin >> t;
    while (t--) {
        solve();
    }
}