#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

ll n , m , k ;
string ret ;

string a[ 2 ] ;

int get_dig ( int x , int &tp ) {
    if ( x == 0 ) {
        if ( tp >= k ) { return -1 ; }
        if ( ret[ tp ] != '0' ) { return -1 ; }
        ++ tp ;
        return 0 ;
    }
    int val = 0 ;
    while ( 1 ) {
        if ( tp >= k ) { return -1 ; }
        val = 10 * val + ( ret[ tp ] - '0' ) ;
        ++ tp ;
        if ( val >= 100 ) { return -1 ; }
        if ( ( val % x ) == 0 ) {
            return ( val / x ) ;
        }
    }
}

bool check ( int fstdig ) {
    for ( int i = 0 ; i < n ; ++ i ) {
        a[ 0 ][ i ] = '-' ;
    }
    for ( int j = 0 ; j < m ; ++ j ) {
        a[ 1 ][ j ] = '-' ;
    }
    a[ 0 ][ 0 ] = char ( '0' + fstdig ) ;
    int tp = 0 , rem = 0 ;
    for ( int i = 0 ; i < n ; ++ i ) {
        for ( int j = 0 ; j < m ; ++ j ) {
            if ( a[ 0 ][ 0 ] == '0' || a[ 1 ][ 0 ] == '0' ) { return false ; }
            int x , y ;
            if ( a[ 0 ][ i ] != '-' ) {
                x = ( a[ 0 ][ i ] - '0' ) ;
                y = get_dig ( x , tp ) ;
                if ( y < 0 ) { return false ; }
                if ( x == 0 ) {
                    continue ; 
                }
                if ( a[ 1 ][ j ] != '-' && ( a[ 1 ][ j ] - '0' ) != y ) {
                    return false ;
                }
                a[ 1 ][ j ] = char ( '0' + y ) ;
            }
            else {
                y = ( a[ 1 ][ j ] - '0' ) ;
                x = get_dig ( y , tp ) ;
                if ( x < 0 ) { return false ; }
                if ( y == 0 ) {
                    continue ;
                }
                if ( a[ 0 ][ i ] != '-' && ( a[ 0 ][ i ] - '0' ) != x ) {
                    return false ;
                }
                a[ 0 ][ i ] = char ( '0' + x ) ;
            }
        }
    }
    if ( a[ 0 ][ 0 ] == '0' || a[ 1 ][ 0 ] == '0' ) { return false ; }
    if ( tp != k ) { return false ; }
    return true ;
}

void solve ( ) {
    cin >> n >> m ;
    cin >> ret ;
    k = ret.size ( ) ;
    if ( n * m > k ) {
        cout << "Impossible\n" ;
        return ;
    }
    a[ 0 ].resize ( n ) ;
    a[ 1 ].resize ( m ) ;
    for ( int fstdig = 1 ; fstdig <= 9 ; ++ fstdig ) {
        if ( check ( fstdig ) == true ) {
            cout << a[ 0 ] << " " << a[ 1 ] << "\n" ;
            return ;
        }
    }
    cout << "Impossible\n" ;
}


int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}