// header file
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// pragma
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// macros
#define endl "\n"
#define ll long long
#define mp make_pair
#define ins insert
#define lb lower_bound
#define pb push_back
#define ub upper_bound
#define lll __int128
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
int main() {
  ios_base::sync_with_stdio(0); cin.tie(NULL);
  int t;
  cin >> t;
  while(t--) {
    int n, m;
    string s;
    cin >> n >> m >> s;
    int a[s.size()];
    for(int i = 0; i < s.size(); ++i)
      a[i] = s[i] - '0';
    bool ans = 0;
    if(1ll * n * m > s.size()) {
      cout << "Impossible" << endl;
      continue;
    }
    for(int i = 1; i <= 9; ++i) {
      // set a[0] to i
      // find values of b
      int idx = 0;
      vector<int> b;
      b.reserve(m);
      bool pos = 1;
      while(idx < s.size() && b.size() < m) {
        if(a[idx] % i == 0) {
          b.pb(a[idx] / i);
          // cerr << a[idx] << endl;
          ++idx;
        }
        else if(idx + 1 < s.size() && (a[idx] * 10 + a[idx + 1]) % i == 0 && (a[idx] * 10 + a[idx + 1]) / i < 10) {
          // cerr << a[idx] << " " << a[idx + 1] << endl;
          b.pb(((a[idx] * 10 + a[idx + 1]) / i));
          idx += 2;
        }
        else {
          pos = 0;
          break;
        }
      }
      // cerr << "DEBUG B " << i << endl;
      // for(auto x : b) {
      //   cerr << x << " ";
      // }
      // cerr << endl;
      if(b.size() < m || !pos) {
        continue;
      }
      vector<int> c = {i};
      c.reserve(n);
      while(c.size() < n && idx < s.size()) {
        // cerr << "DEBUG " << i << " " << b[0] << " " << (a[idx] * 10 + a[idx + 1]) << endl;
        if(a[idx] % b[0] == 0) {
          c.pb(a[idx] / b[0]);
          ++idx;
        }
        else if(idx + 1 < s.size() && (a[idx] * 10 + a[idx + 1]) % b[0] == 0 && (a[idx] * 10 + a[idx + 1]) / b[0] < 10) {
          c.pb((a[idx] * 10 + a[idx + 1]) / b[0]);
          idx += 2;
        }
        for(int i = 1; i < b.size(); ++i) {
          if(idx < s.size() && a[idx] == b[i] * c.back()) {
            ++idx;
          }
          else if(idx + 1 < s.size() && a[idx] * 10 + a[idx + 1] == b[i] * c.back()) {
            idx += 2;
          }
          else {
            pos = 0;
            break;
          }
        }
        if(!pos)
          break;
      }
      // cerr << i << endl;
      // for(auto x : c) {
      //   cerr << x << " ";
      // }
      // cerr << endl;
      if(!pos || c.size() != n || b.size() != m || idx != s.size()) {
        continue;
      }
      else {
        for(auto x : c)
          cout << x;
        cout << " ";
        for(auto x : b)
          cout << x;
        cout << endl;
        ans = 1;
        break;
      }
    }
    if(!ans)
      cout << "Impossible" << endl;
  }
  return 0;
}