#include <bits/stdc++.h>
#define ll long long
#define pii pair <int, int>
#define fi first
#define se second
#define pb push_back

using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
int n, m;
string c, t[10], b, a, nw;
string tx (int x) {
	string res = ""; res += (char)(x%10+'0');
	if (x < 10) { return res; }
	return tx(x/10)+res;
}

void solve () {
	cin >> n >> m >> c;
	if (1ll*n*m > c.size()) {
		cout << "Impossible\n"; return;
	}
	int o = 0;
	for (int i = 1;i <= 9;i++) {
		b = ""; int fl = 1, x = 0;
		for (int j = 0;j < c.size();j++) {
			x = x*10+(c[j]^48);
			if (x >= i*10) {
				fl = 0; break;
			}
			if (x%i == 0) {
				b += (char)(x/i+'0'); x = 0;
			}
			if (b.size() > m) {
				fl = 0; break;
			}
			if (b.size() == m) {
				break;
			}
		}
		if (!fl) continue;
		nw = "";
		for (int j = 0;j < 10;j++) {
			t[j] = "";
			for (int z = 0;z < b.size();z++) {
				t[j] += tx((b[z]-'0')*j);
			}
		}
		string nw = t[i], a = tx(i);
		while (nw.size() < c.size()) {
			int fl = 0;
			for (int j = 0;j < 10;j++) {
				if (nw.size()+t[j].size() <= c.size()) {
					fl = 1;
					for (int z = 0;z < t[j].size();z++) if (t[j][z] != c[nw.size()+z]) {
						fl = 0; break;
					}
					if (fl) {
						a += tx(j);
						nw += t[j]; break;
					}
				}
			}
			if (!fl) break;
		}
		if (a.size() == n && nw.size() == c.size()) {
			cout << a << " " << b << "\n";
			return;
		}
	}
	cout << "Impossible\n";
}

signed main () {
//	ios::sync_with_stdio(0);
//	cin.tie(0); cout.tie(0);
	int T = 1; cin >> T;
	while (T--) solve();
	return 0;
}