#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

void solve() {
  int n, m;
  cin >> n >> m;
  string s;
  cin >> s;
  auto move_digit = [&](int i, int d) {
    if (i == s.size() || i == -1)
      return -1;
    if (s[i] != '0' + d)
      return -1;
    return i + 1;
  };
  auto move_num = [&](int i, int x) {
    if (x < 10)
      return move_digit(i, x);
    return move_digit(move_digit(i, x / 10), x % 10);
  };
  auto move_div = [&](int i, int a) {
    if (i == s.size() || i == -1)
      return make_pair(-1, -1);
    int k = s[i] - '0';
    if (k != 0 && k < a) {
      ++i;
      if (i == s.size())
        return make_pair(-1, -1);
      k = k * 10 + s[i] - '0';
    }
    if (k % a != 0)
      return make_pair(-1, -1);
    return make_pair(i + 1, k / a);
  };
  vector<int> a(n);
  vector<int> b(m);
  for (a[0] = 1; a[0] < 10; ++a[0]) {
    int cur_i = 0;
    bool ok = true;
    for (int j = 0; ok && j < m; ++j) {
      auto tmp = move_div(cur_i, a[0]);
      if (tmp.first == -1) {
        ok = false;
        break;
      }
      b[j] = tmp.second;
      cur_i = tmp.first;
    }
    if (!ok || b[0] == 0)
      continue;
    for (int i = 1; ok && i < n; ++i) {
      auto tmp = move_div(cur_i, b[0]);
      if (tmp.first == -1) {
        ok = false;
        break;
      }
      a[i] = tmp.second;
      cur_i = tmp.first;
      for (int j = 1; ok && j < m; ++j) {
        cur_i = move_num(cur_i, b[j] * a[i]);
      }
      if (cur_i == -1) {
        ok = false;
        break;
      }
    }
    if (ok && cur_i == s.size()) {
      for (int i = 0; i < n; ++i)
        cout << a[i];
      cout << ' ';
      for (int j = 0; j < m; ++j)
        cout << b[j];
      cout << '\n';
      return;
    }
  }
  cout << "Impossible\n";
}


int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}