#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void solve() {
  int n,m;
  cin >> n >> m;
  string s;
  cin >> s;
  auto calc = [&](int a, vector<int>& B) -> bool {
    int cur = 0;
    B.assign(m, 0);
    for (int i=0;i<m;i++){
      if (cur >= s.size()) {
        return false;
      }
      if ((s[cur] - '0') % a != 0) {
        if (cur+1 >= s.size()) {
          return false;
        }
        int d = (s[cur] - '0') * 10 + (s[cur+1]-'0');
        if (d % a != 0) {
          return false;
        }
        B[i] = d/a;
        cur+=2;
      } else {
        int d = s[cur] - '0';
        if (d % a != 0) {
          return false;
        }
        B[i] = d/a;
        cur++;
      }
    }
    return true;
  };
  auto check = [&](vector<int>& B, vector<int>& A) -> bool {
    A.assign(n, 0);
    int cur = 0;
    for (int i=0;i<n;i++){
      for (int j=0;j<m;j++){
        if (cur >= s.size()) {
          return false;
        }
        if (B[j] == 0) {
          if (s[cur] != '0')
            return false;
          cur++;
          continue;
        }
        if ((s[cur] - '0') % B[j] != 0) {
          if (cur+1 >= s.size()) {
            return false;
          }
          int d = (s[cur] - '0') * 10 + (s[cur+1]-'0');
          if (d % B[j] != 0) return false;
          if (j == 0) {
            A[i] = d/B[j];
          } else if (A[i] != d/B[j]) {
            return false;
          }
          cur+=2;
        } else {
          int d = s[cur] - '0';
          if (j == 0) {
            A[i] = d/B[j];
          } else if (A[i] != d/B[j]) {
            return false;
          }
          cur++;
        }
      }
    }
    return cur == s.size();
  };
  for (int a=1;a<9;a++){
    vector<int> B,A;
    if (calc(a, B) && check(B,A)) {
      for (int i=0;i<n;i++){
        cout << A[i];
      }
      cout << " ";
      for (int i=0;i<m;i++){
        cout << B[i];
      }
      cout << "\n";
      return;
    }
  }
  cout << "Impossible" << "\n";
}

int main() {
  int t;
  cin >> t;
  while (t--)
    solve();
}