#include <bits/stdc++.h>
#define int long long 
#define x first
#define y second
using namespace std;
typedef pair<int,int>PII;
const int N = 2e5+10,M=1e5,INF=1e12,mod=998244353;
char s[N];
int a[N],b[N],n,m,len;
int mp[15][105];
bool check(int mid)
{
    int x = mid;
    a[1]=x;
    int now=1;
    for(int j=1;j<=m;j++)
    {
        if(now>len) return false;
        if(~mp[x][s[now]-'0'])
        {
            b[j] = mp[x][s[now]-'0'];
            now++;
        }
        else
        {
            if(now>=len)    return false;
            int t = (s[now]-'0')*10+s[now+1]-'0';
            if(~mp[x][t])
            {
                b[j]=mp[x][t];
                now+=2;
            }
            else    return false;
        }
    }
    if(b[1]==0) return false;
    x=b[1];
    for(int i=2;i<=n;i++)
    {
        if(now>len) return false;
        if(~mp[x][s[now]-'0'])
        {
            a[i] = mp[x][s[now]-'0'];
            now++;
        }
        else
        {
            if(now>=len)    return false;
            int t = (s[now]-'0')*10+s[now+1]-'0';
            if(~mp[x][t])
            {
                a[i]=mp[x][t];
                now+=2;
            }
            else    return false;
        }
        for(int j=2;j<=m;j++)
        {
            int t = a[i]*b[j];
            if(t<10)
            {
                if(now>len) return false;
                if(t!=s[now]-'0')   return false;
                now++;
            }
            else
            {
                if(now>=len) return false;
                if(t!=(s[now]-'0')*10+s[now+1]-'0') return false;
                now+=2;
            }
        }
    }
    return now==len+1;
}
void solve()
{
    scanf("%lld%lld",&n,&m);
    scanf("%s",s+1);
    len=strlen(s+1);
    for(int i=1;i<=9;i++)
        if(check(i))
        {
            for(int j=1;j<=n;j++)   printf("%lld",a[j]);
            printf(" ");
            for(int j=1;j<=m;j++)   printf("%lld",b[j]);
            puts("");
            return ;
        }
    puts("Impossible");
}

signed main()
{
	int T=1;
	cin>>T;
	memset(mp,-1,sizeof mp);
	for(int i=0;i<=9;i++)
	    for(int j=0;j<=9;j++)
	        mp[i][i*j] = j;
	while(T--)
	{
		solve();
	}
	return 0;
}