#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=110005;
int n,m;
string a,b,s;
string ansa,ansb;
vector<pair<int,int> > nums;
bool check(pair<int,int> it){
	a=b="";
	a+=it.first+'0',b+=it.second+'0';
	int k=0;
	int u=0;
	for(int p=1;p<s.length()-1;p++){
		if(k>m-1)k=0,u=0;
		if(b.length()==m){
			
		if(b[k]=='0'){
			k++;
		}	
		else if((s[p]-'0') % (b[k]-'0') ==0){
		//	cout<<((s[p]-'0')/(b[k]-'0'))<<endl;
			if(u==0)a+=((s[p]-'0')/(b[k]-'0'))+'0',u=1;
			k++;
		}
		else if( ( ( (s[p+1]-'0') + 10*(s[p]-'0') ) % (b[k]-'0') )  == 0  ){
			if(u==0)a+=( ( (s[p+1]-'0') + 10*(s[p]-'0') ) / (b[k]-'0') )+'0',u=1;
			p++;k++;
		}
		
		else return false;	
					
		}
		else {
		if(s[p]=='0'){
			b+='0';
		}	
		else if((s[p]-'0')%it.first==0){
			b+=((s[p]-'0')/it.first)+'0';
		}
		else if( ( ( (s[p+1]-'0') + 10*(s[p]-'0') ) %it.first)  == 0  ){
			b+= ( ( (s[p+1]-'0') + 10*(s[p]-'0') ) /it.first)+'0';
			p++;
		}
		else return false;		
			
		}
	//	cout<<a<<" "<<b<<endl;
	}
	if(a.length()!=n)return false;
	return true;
}
void solve(){
	cin>>n>>m;ansa=ansb="";
	cin>>s;
	if(s.length()<n*m||s.length()>n*m*2){
		cout<<"Impossible"<<endl;
		return;
	}
	if(s.length()==1){
		for(int i=0;i<=9;i++){
			for(int j=1;j<=9;j++){
				if(i*j==s[0]-'0'){
					cout<<i<<" "<<j<<endl;
					return;
				}
			}
		}
	}
	else {
		s+='0';
		int s1=s[0]-'0',s2=10*(s[0]-'0')+s[1]-'0';
		nums.clear();
		for(int i=0;i<=9;i++){
			for(int j=1;j<=9;j++){
				if(i*j==s1){
					nums.emplace_back(make_pair(i,j));
				}
			}
		}
		for(auto it:nums){
			if(check(it)){
				if(ansa==""){
					ansa=a,ansb=b;
				}
				else {
					if(ansa>a){
						ansa=a,ansb=b;
					}
					else if(ansa==ansb&&ansb>b){
						ansa=a,ansb=b;
					}
				}
			}
		}		
	}
	if(ansa!=""){
		cout<<ansa<<" "<<ansb<<endl;
	}
	else cout<<"Impossible"<<endl;
	return;
}
signed main() {
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	int t=1;
	cin>>t;
	while(t--){
		solve();
	}
    return 0;
}