#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
char c[N];
int n, m, K, a[N], b[N];
void solve() {
    scanf("%d%d", &n, &m);
    scanf("%s", c + 1);
    K = strlen(c + 1);
    if(c[1] == '0' && K == 1) {
        if(n == 1) {
            printf("0 ");
            if(m > 1) printf("1"), m--;
            for(int i = 1; i <= m; i++)
                printf("0");
            printf("\n");
        }else if(m == 1) {
            if(n > 1) printf("1"), n--;
            for(int i = 1; i <= n; i++)
                printf("0");
            printf(" 0\n");
        }else printf("Impossible\n");
        return;
    }
    for(int i = 1; i <= 9; i++) {
        a[1] = i;
        int flag = 1, k = 1;
        for(int j = 1; j <= m; j++, k++) {
            if(k > K) {flag = 0; break;}
            int sum = c[k] - 48;
            if(k < K && sum < i && sum != 0) k++, sum = sum * 10 + c[k] - 48;
            if(sum == 0 || sum % i == 0) b[j] = sum / i;
            else {
                flag = 0;
                break;
            }
        }
        if(!flag) continue;
    //    cout << i << " " << k << "\n";
        for(int j = 2; j <= n; j++) {
            if(k > K) {flag = 0; break;}
            int sum = c[k] - 48;
            if(k < K && sum < b[1] && sum != 0) k++, sum = sum * 10 + c[k] - 48;
            if(sum == 0 || sum % b[1] == 0) {
                a[j] = sum / b[1];
                k++;
                for(int mm = 2; mm <= m; mm++) {
                    if(k > K) {
                        flag = 0;
                        break;
                    }
                    sum = a[j] * b[mm];
                    if(sum < 10) {
                        if(sum == c[k] - 48) k++;
                        else {
                            flag = 0;
                            break;
                        }
                    }else {
                        if(sum / 10 == c[k] - 48 && sum % 10 == c[k + 1] - 48) k += 2;
                        else {
                            flag = 0;
                            break;
                        }
                    }
                }
                if(!flag) break;
            }else {
                flag = 0; 
                break;
            }
        }
        if(!flag || k <= K) continue;
        for(int i = 1; i <= n; i++)
            printf("%d", a[i]);
        printf(" ");
        for(int i = 1; i <= m; i++)
            printf("%d", b[i]);
        cout << "\n";
        return;
    }
    puts("Impossible");
}
int main() {
    int T; cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}
/*
4
2 2
8101215
3 4
100000001000
2 2
80101215
3 4
1000000010000

*/