#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define MAXN 2100000
using namespace std;
int T;
int n,m;
int A[MAXN],B[MAXN];
bool visA[MAXN],visB[MAXN];
char s[MAXN];
int len;

void clear_vis(){
    for(int i=1;i<=n;i++)visA[i]=0;
    for(int i=1;i<=m;i++)visB[i]=0;
}

bool check(int x,int y,char* &z){
    //cout<<x<<" "<<y<<endl;
    if(z[0]=='\0')return 0;
    if(!visA[x] && !visB[y])return 0;
    if(visA[x]&&visB[y]){
        int t = A[x]*B[y];
        if(t>=10){
            if(z[1]=='\0')return 0;
            if(z[0]-'0'==t/10 && z[1]-'0'==t%10){
                z+=2;return 1;
            }
            return 0;
        }
        else{
            if(z[0]-'0'==t){
                z+=1;return 1;
            }
            return 0;
        }
    }
    else if(visA[x]){
        int a = A[x];
        int now = z[0]-'0';
        
        if(now<a && now){
            if(z[1]=='\0')return 0;
            now = now*10 + z[1]-'0';
            z++;
        }//cout<<"now"<<now<<" "<<a<<endl;
        if(now%a==0){
            B[y]=now/a;visB[y]=1;
            z++;
            return 1;
        }
        return 0;
    }
    else if(visB[y]){
        int b = B[y];
        int now = z[0]-'0';
        if(now<b && now){
            if(z[1]=='\0')return 0;
            now = now*10 + z[1]-'0';
            z++;
        }
        //cout<<now<<" Bnow "<<b<<" "<<(z-s)<<endl;
        if(now%b==0){
            A[x]=now/b;visA[x]=1;
            z++;
            return 1;
        }
        return 0;
    }
    return 0;
}

int main(){

    scanf("%d",&T);
    while(T--){
        scanf("%d%d",&n,&m);
        scanf("%s",s);
        len=strlen(s);
        
        bool flag=0;
        for(int i=1;i<=9;i++){
            clear_vis();
            visA[1]=1;
            A[1]=i;
            char *str = s;
            int nsh=0;
            for(int x=1;x<=n;x++)
                for(int y=1;y<=m;y++){
                    if(!check(x,y,str)){
                        x=n+1,nsh=1;break;
                    }
                }
            if(str-s!=len)continue;
            if(nsh)continue;
            flag=1;
            break;
        }
        if(!flag){
            puts("Impossible");
        }
        else{
            for(int i=1;i<=n;i++)putchar('0'+A[i]);putchar(' ');
            for(int i=1;i<=m;i++)putchar('0'+B[i]);putchar('\n');
        }

    }
    return 0;
}