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

//#define DEBUG

#ifdef DEBUG
const ll N = 1010;
#endif
#ifndef DEBUG
const ll N = 200100;
#endif
ll a[N], b[N];
int main()
{
	#ifdef DEBUG
	freopen("1.txt", "r", stdin);
	#endif
	#ifndef DEBUG
	ios::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);
	#endif
	ll z; 
	cin >> z;
	while(z--)
	{
		ll n, m;
		cin >> n >> m;
		string s;
		cin >> s;
		
		if(n == 1 && m == 1 && s == "0")
		{
			cout << "0 0\n";
			continue;
		}
		
		ll len = s.size();
		ll pos = 0;
		auto calc = [&] (ll x) {
			if(pos >= len) throw false;
			ll tmp = s[pos]-48;
			if(tmp % x == 0 && tmp / x <= 9) 
			{
				pos++;
				return tmp / x;
			}
			else
			{
				if(pos >= len-1) throw false;
				tmp *= 10;
				tmp += s[pos+1] - 48;
				if(tmp % x == 0 && tmp / x <= 9)
				{
					pos += 2;
					return tmp / x;
				}
				else throw false;
			}
			return -1ll;
		};
		auto chk = [&] (ll x, ll y) {
			if(pos >= len) throw false;
			ll tmp = s[pos]-48;
			if(tmp == x*y) 
			{
				pos++;
				return 1;
			}
			else
			{
				if(pos >= len-1) throw false;
				tmp *= 10;
				tmp += s[pos+1] - 48;
				if(tmp == x*y) 
				{
					pos += 2;
					return 1;
				}
				else return 0;
			}
			return 0;
		};
		for(ll i=1; i<=9; i++)
		{
			pos = 0;
			try
			{
				a[0] = i;
				for(ll i=0; i<m; i++)
					b[i] = calc(a[0]);
				for(ll i=1; i<n; i++)
				{
					a[i] = calc(b[0]);
					for(ll j=1; j<m; j++)
					{
						if(!chk(a[i], b[j])) throw false;
					}
				}
				
				throw true;
			}
			catch(bool &e)
			{
				if(e)
				{
					if(pos == len)
					{
						for(ll i=0; i<n; i++) cout << a[i];
						cout <<' ' ;
						for(ll i=0; i<m; i++) cout << b[i];
						cout << '\n';
						goto fin;
					}	
				}
				else
				{
					;
				}
			}
		}
		cout << "Impossible\n";
		fin:;
	}
	return 0;
}