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

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(const char *s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(const char *s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  for (int f = 0; L != R; L++)
    cerr << (f++ ? ", " : "") << *L;
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

void solve() {
  int n, m;
  cin >> n >> m;
  vector<string> A(n), B(n);
  for (int i = 0; i < n; i++) {
    cin >> A[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> B[i];
  }
  
  {
    vector<int> a(n), b(n);
    iota(all(a), 0);
    iota(all(b), 0);
    sort(all(a), [&](int x, int y) { return A[x] < A[y]; });
    sort(all(b), [&](int x, int y) { return B[x] < B[y]; });
    string TA, TB;
    for (int i : a) TA += A[i];
    for (int i : b) TB += B[i];
    if (TA == TB) {
      for (int i = 0; i < n; i++)
        cout << a[i] + 1 << (i+1==n ? '\n' : ' ');
      for (int i = 0; i < n; i++)
        cout << b[i] + 1 << (i+1==n ? '\n' : ' ');
      return;
    }
  }


  const auto ID = [](map<string, int> &mp, string s) -> int {
    if (auto it = mp.find(s); it != mp.end())
      return it->second;
    return mp[s] = mp.size();
  };

  vector<uint64_t> LA(n), RA(n), LB(n), RB(n);
  for (int k = 1; k < m; k++) {
    // map<string, int> lef, rig;
    vector<uint64_t> lef, rig;

    vector<vector<pair<int,int>>> g(n * 4);
    vector<int> in(n * 4);

    std::hash<string> hasher;

    for (int i = 0; i < n; i++) {
      LA[i] = hasher(A[i].substr(0, k));
      lef.emplace_back(LA[i]);
      RA[i] = hasher(A[i].substr(k));
      rig.emplace_back(RA[i]);
    }
    for (int i = 0; i < n; i++) {
      LB[i] = hasher(B[i].substr(m - k));
      lef.emplace_back(LB[i]);
      RB[i] = hasher(B[i].substr(0, m - k));
      rig.emplace_back(RB[i]);
    }
    sort(all(lef));
    sort(all(rig));

    for (int i = 0; i < n; i++) {
      int R = int(lower_bound(all(rig), RA[i]) - begin(rig));
      int L = int(lower_bound(all(lef), LA[i]) - begin(lef));
      g[L * 2].emplace_back(R * 2 + 1, i);
      in[R * 2 + 1] += 1;
    }
    for (int i = 0; i < n; i++) {
      int R = int(lower_bound(all(rig), RB[i]) - begin(rig));
      int L = int(lower_bound(all(lef), LB[i]) - begin(lef));
      g[R * 2 + 1].emplace_back(L * 2, i + n);
      in[L * 2] += 1;
    }

    bool ok = true;
    for (int i = 0; i < n * 4; i++) {
      ok &= in[i] == g[i].size();
    }
    if (!ok) continue;

    vector<int> vis(n * 2), ans;
    const auto dfs = [&](auto self, int i) -> void {
      while (!g[i].empty()) {
        auto [j, eid] = g[i].back(); g[i].pop_back();
        vis[eid] = true;
        self(self, j);
        ans.push_back(eid);
      }
    };
    dfs(dfs, 0);

    if (ans.size() == n * 2) {
      reverse(all(ans));
      vector<int> L, R;
      for (size_t i = 0; i < ans.size(); i += 2) {
        L.push_back(ans[i]);
        R.push_back(ans[i + 1]);
      }
      if (L[0] >= n) {
        swap(L, R);
      }

      for (int i = 0; i < n; i++) {
        cout << L[i] + 1 << (i+1==n ? '\n' : ' ');
      }
      for (int i = 0; i < n; i++) {
        R[i] -= n;
        cout << R[i] + 1 << (i+1==n ? '\n' : ' ');
      }

      return;
    }
  }

  cout << -1 << '\n';

}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--)
    solve();

  return 0;
}