#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int MAXN = 2e5 + 10;

char str[MAXN];
int n, m, a[MAXN], b[MAXN];

int main() {
	int t; cin >> t;
	while (t--) {
		cin >> n >> m;
		cin >> str + 1;
		int Start = 1;
		bool Fflag = false;
		for (int i = 1; i <= 9; i++) {
			int j = 1;
			Start = 1;
			for (; j <= m; j++) {
				int x = str[Start] - '0', y = (str[Start] - '0') * 10 + (str[Start + 1] - '0');
				if (x % i == 0 && x <= 9 * i) {
					b[j] = x / i;
					Start++; 
				} else if (y % i == 0 && y <= 9 * i && x != 0) {
					b[j] = y / i;
					Start += 2;
				} else 
					break;
			}
			if (j > m) {
				a[1] = i;
				bool Flag = true;
				for (int ii = 2; ii <= n; ii++) {
					bool flag = false;
					for (int k = 0; k <= 9; k++) {
						int Sstart = Start, j = 1;
						for (; j <= m; j++) {
							int x = str[Sstart] - '0', y = (str[Sstart] - '0') * 10 + (str[Sstart + 1] - '0');
							if (x == k * b[j]) {
								Sstart++;
							} else if (y == k * b[j] && x != 0) {
								Sstart += 2;
							} else
								break;
						}
						if (j > m) {
							Start = Sstart;
							a[ii] = k;
							flag = true;
							break;
						}
					}
					if (!flag) {
						Flag = false;
						break;
					}
				}
				if (Flag && Start == strlen(str + 1) + 1) {
					for (int ii = 1; ii <= n; ii++) cout << a[ii];
					cout << " ";
					for (int ii = 1; ii <= m; ii++) cout << b[ii];
					cout << endl;
					Fflag = true;
					break;
				}
			}
		}
		if (!Fflag) printf("Impossible\n");
	}	
	return 0;
}