#include <stdio.h>
#include <string.h>

#include <vector>
#include <algorithm>

#define eb emplace_back

#define LOG(FMT...) fprintf(stderr, FMT)

using namespace std;

typedef long long LL;
constexpr int N = 1000005;

int n, m, szc;
char a[N], b[N], c[N];

int mat(int &j, int x) {
	if (x == 0) {
		if (c[j]) {
			return -1;
		}
		j += 1;
		return 10;
	}
	if (!c[j]) {
		j += 1;
		return 0;
	}
	if (!(c[j] % x)) {
		return c[j++] / x;
	}
	if (c[j] >= x) {
		return -1;
	}
	if (j == szc - 1) {
		return -1;
	}
	int t = c[j] * 10 + c[j + 1];
	if (t % x) {
		return -1;
	}
	t /= x;
	if (t >= 10) {
		return -1;
	}
	j += 2;
	return t;
}

bool chk(int x) {
	int j = 0;
	for (int i = 0, j = 0; i < m; ++i) {
		b[i] = mat(j, x);
		if (b[i] == -1) {
			return false;
		}
	}
	/* LOG("x: %d\n", x);
	for (int i = 0; i < m; ++i) {
		LOG("%d", b[i]);
	}
	LOG("\n"); */
	j = 0;
	for (int k = 0; k < n; ++k) {
		a[k] = mat(j, b[0]);
		if (a[k] == -1) {
			return false;
		}
		for (int i = 1; i < m; ++i) {
			int t = mat(j, b[i]);
			if (t != 10 && t != a[k]) {
				return false;
			}
		}
	}
	return j == szc;
}

void solve() {
	scanf("%d%d%s", &n, &m, c);
	szc = strlen(c);
	if (szc < n * (LL)m) {
		puts("Impossible");
		return;
	}
	for (int i = 0; i < szc; ++i) {
		c[i] ^= 48;
	}
	if (c[0] == 0) {
		puts("Impossible");
		return;
	}
	for (int x = 1; x < 10; ++x) {
		if (chk(x)) {
			for (int i = 0; i < n; ++i) {
				printf("%d", a[i]);
			}
			printf(" ");
			for (int i = 0; i < m; ++i) {
				printf("%d", b[i]);
			}
			puts("");
			return;
		}
	}
	puts("Impossible");
}

int main() {
	int task;
	for (scanf("%d", &task); task--; ) {
		solve();
	}
	return 0;
}