#include<bits/stdc++.h>
using namespace std;

// #define endl '\n'
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
#define rept(i, a, ne) for(int i = (a); ~i ; i=ne[i])
#define debug(x) cout<<#x<<": "<<x<<endl
#define fi first
#define sec second
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
typedef long long LL;
typedef long double  LD;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef pair<int,int>PII;
const int N=2e5+10;
LL n,m;
int a[N],b[N];
string s;
LL len;
LL get(int x)
{
    return s[x]-'0';
}
bool op(int x)
{
    int n2=0;
    rep(i,2,n)
    a[i]=-1;
    a[1]=x;
    rep(i,1,len)
    {
        if(get(i)%x==0)
        {
            b[++n2]=get(i)/x;
            if(b[n2]>9)
            return 0;
        }
        else if(i!=len&&get(i)&&(get(i)*10+get(i+1))%x==0)
        {

            b[++n2]=(get(i)*10+get(i+1))/x;
            if(b[n2]>9)
            return 0;
            i++;
        }
        else
        return 0;

        if(n2==m)
        break;
    }

    if(n2<m)
    return 0;
    int n1=0;
    int p=0;
    int sum=0;
    rep(i,1,len)
    {
        if(sum>n*m)
        return 0;
        if(sum%m==0)
        ++n1;
        ++p;
        if(b[p]==0)
        {
            if(get(i)!=0)
            {
                return 0;
            }
        }
        else if(get(i)%b[p]==0)
        {
            if(a[n1]!=-1)
            {
                if(a[n1]!=get(i)/b[p])
                return 0;
            }
            else 
            {
                a[n1]=get(i)/b[p]; 
                if(a[n1]>9)
                return 0;
            }
            
        }
        else if(i!=len&&get(i)&&(get(i)*10+get(i+1))%b[p]==0)
        {
            int y=(get(i)*10+get(i+1));
            if(a[n1]!=-1)
            {
                if(a[n1]!=y/b[p])
                return 0;
            }
            else 
            {
                a[n1]=y/b[p];
                if(a[n1]>9)
                return 0;
            }
            
            i++;
        }
        else
        return 0;


        sum++;
        p%=m;
    }
    if(sum!=n*m)
    return 0;
    
    return 1;
}
void slove()
{
    cin>>n>>m;
    cin>>s;
    len=s.size();
    s='0'+s;

    if(len<n*m||len>n*m*2)
    {
        cout<<"Impossible"<<endl; 
        return;
    }

    rep(i,1,9)
    {
        if(op(i))
        {
            rep(i,1,n)
            cout<<a[i];
            cout<<' ';
            rep(i,1,m)
            cout<<b[i];
            cout<<endl;
            return;
        }
    }
    cout<<"Impossible"<<endl;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
//	cout << fixed << setprecision(9);
    int t=1;
	cin>>t;

    while(t--)
    {
        slove();
    }


    return 0;
}
//#pragma GCC optimize(2)