#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define fer(i,a,b) for(int i=a;i<=b;i++)
#define fdr(i,a,b) for(int i=a;i>=b;i--)
const int N=2e5+10;

int n,m;
string s;
int a[N],b[N]; 

bool cal(){
	int len=s.size(),pos=0;
	fer(i,0,m-1){
		if(pos==len) return false;
		int x=s[pos++]-'0';
		if(pos<len&&x&&x<a[0]) x=x*10+s[pos++]-'0';
		if(x%a[0]||x/a[0]>9) return false;
		b[i]=x/a[0];
	}
//	fer(i,0,m-1) cout<<b[i];
//	cout<<endl;
	fer(i,1,n-1){
		if(pos==len) return false;
		int x=s[pos++]-'0';
		if(pos<len&&x&&x<b[0]) x=x*10+s[pos++]-'0';
		a[i]=x/b[0];
		if(x%b[0]!=0||a[i]>9) return false;
		fer(j,1,m-1){
			if(pos==len) return false;
			x=s[pos++]-'0';
			if(pos<len&&x&&x<b[j]) x=x*10+s[pos++]-'0';
			if(x==0){
				if(a[i]&&b[j]) return false;
			}
			else{
				if(b[j]==0) return false;
				if(x%b[j]||(x/b[j]!=a[i])) return false;
			}
		}
	}
//	cout<<"pos"<<pos<<endl;
	if(pos!=len) return false;
	return true;
}

bool vis(int x){
	fer(i,1,9){
		if(x%i==0){
			a[0]=i;
			if(cal()) return true;
		}
	}
	return false;
}

bool solve(){
	int x=s[0]-'0';
	if(vis(x)) return true;
	x=x*10+s[1]-'0';
	if(vis(x)) return true;
	return false;
}

signed main(){
	ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
	int t;
	cin>>t;
	while(t--){
		cin>>n>>m>>s;
		if(solve()){
			fer(i,0,n-1) cout<<a[i];
			cout<<' ';
			fer(i,0,m-1) cout<<b[i];
			cout<<endl;
		}
		else cout<<"Impossible\n";
	}
}