#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000010, maxm = maxn * 4;
int T, n, m, len, s[maxm];
vector<int> sa, rk, t, x, y, ht, lg, st[22];
//int sa[maxm], rk[maxm], t[maxm], x[maxm], y[maxm], ht[maxm], lg[maxm], st[22][maxm];
int posa[maxn], posb[maxn], pos[maxn * 2], fa[maxn * 2], id[maxn * 2];
int p[maxn], q[maxn], ansp[maxn], ansq[maxn];
string a[maxn], b[maxn];
struct edge{ int to, nxt; } e[maxm];
int head[maxm], k, deg[maxm], stk[maxm], tp;
inline void sa_init() {
  sa.resize(max(len, n * 2 + 26) + 1);
  rk.resize(len + 1);
  t.resize(max(len, n * 2 + 26) + 1);
  x.resize(len + 1);
  y.resize(len + 1);
  ht.resize(len + 1);
  lg.resize(len + 1);
  for(int i = 0; i < 22; ++i) st[i].resize(len + 1);

  int cnt = n * 2 + 26;
  for(int i = 1; i <= cnt; ++i) t[i] = 0;
//  memset(t, 0, sizeof(int) * (cnt + 10));
  for(int i = 1; i <= len; ++i) ++t[x[i] = s[i] + 1];
  for(int i = 1; i <= cnt; ++i) t[i] += t[i - 1];
  for(int i = len; i; --i) sa[t[x[i]]--] = i;
  for(int k = 1; k <= len; k <<= 1) {
    for(int i = 1; i <= cnt; ++i) t[i] = 0;
//    memset(t, 0, sizeof(int) * (cnt + 10));
    for(int i = 1; i <= len; ++i) ++t[x[i]];
    for(int i = 1; i <= cnt; ++i) t[i] += t[i - 1];
    int cnt2 = 0;
    for(int i = len - k + 1; i <= len; ++i) y[++cnt2] = i;
    for(int i = 1; i <= len; ++i) if(sa[i] > k) y[++cnt2] = sa[i] - k;
    for(int i = len; i; --i) sa[t[x[y[i]]]--] = y[i];
//    memset(y, 0, sizeof(int) * (len + 10));
    for(int i = 1; i <= len; ++i) y[i] = 0;
    swap(x, y), x[sa[1]] = cnt2 = 1;
    for(int i = 2; i <= len; ++i) x[sa[i]] = (y[sa[i]] == y[sa[i - 1]] && y[sa[i] + k] == y[sa[i - 1] + k]) ? cnt2 : ++cnt2;
    if(cnt2 == len) break;
    else cnt = cnt2;
  }

  cnt = 0;
  for(int i = 1; i <= len; ++i) rk[sa[i]] = i;
  for(int i = 1; i <= len; ++i) if(rk[i] > 1) {
    if(cnt) --cnt;
    int j = sa[rk[i] - 1];
    while(i + cnt <= len && j + cnt <= len && s[i + cnt] == s[j + cnt]) ++cnt;
    ht[rk[i]] = cnt;
  }

  for(int i = 2; i <= len; ++i) st[0][i] = ht[i], lg[i] = lg[i >> 1] + 1;
  for(int j = 0; j < 21; ++j) for(int i = (1 << j + 1) | 1; i <= len; ++i) st[j + 1][i] = min(st[j][i], st[j][i - (1 << j)]);
}
inline int LCP(int x, int y) {
  if(x == y) return len - x + 1;
  x = rk[x], y = rk[y];
//  cout << x << ' ' << y << '\n';
  if(x > y) swap(x, y);
  int l = lg[y - x];
  if(x + (1 << l) > len) while(1);
  return min(st[l][x + (1 << l)], st[l][y]);
}
int getfa(int x) {
  if(fa[x] == x) return x;
  return fa[x] = getfa(fa[x]);
}
inline void add(int u, int v) {
//  cout << u << ' ' << v << '\n';
  e[++k] = {v, head[u]}, head[u] = k;
  ++deg[u], --deg[v];
}
void dfs(int u) {
//  cout << u << '\n';
  for(int i = head[u]; i; i = head[u]) head[u] = e[i].nxt, dfs(e[i].to);
  stk[++tp] = u;
}
inline void solve() {
  cin >> n >> m, len = 0;
  for(int i = 1; i <= n; ++i) cin >> a[i];
  for(int i = 1; i <= n; ++i) cin >> b[i];
//  n = m = 1, len = 0;
//  for(int i = 1; i <= n; ++i) a[i] = b[i] = "b";
  for(int i = 1; i <= n; ++i) {
    posa[i] = len + 1;
    for(int j = 0; j < m; ++j) s[++len] = a[i][j] - 'a';
    s[++len] = 25 + i;
  }
  for(int i = 1; i <= n; ++i) {
    posb[i] = len + 1;
    for(int j = 0; j < m; ++j) s[++len] = b[i][j] - 'a';
    s[++len] = 25 + n + i;
  }
  sa_init();
//  cout << len << '\n';
//  for(int i = 1; i <= len; ++i) cout << s[i] << ' '; cout << '\n';
//  for(int i = 1; i <= len; ++i) cout << rk[i] << ' '; cout << '\n';
//  for(int i = 1; i <= len; ++i) cout << ht[i] << ' '; cout << '\n';

  for(int i = 1; i <= n; ++i) p[i] = q[i] = i;
  sort(p + 1, p + 1 + n, [&](int x, int y) {
//    cout << x << ' ' << y << ' ' << posa[x] << ' ' << posa[y] << '\n';
    int lcp = LCP(posa[x], posa[y]);
//    cout << x << ' ' << y << ' ' << lcp << '\n';
    return lcp == m || a[x][lcp] <= a[y][lcp];
  });
  if(n == 500000 && m == 2) return;
  sort(q + 1, q + 1 + n, [&](int x, int y) {
    int lcp = LCP(posb[x], posb[y]);
    return lcp == m || b[x][lcp] <= b[y][lcp];
  });
//  for(int i = 1; i <= n; ++i) cout << p[i] << ' '; cout << '\n';
//  for(int i = 1; i <= n; ++i) cout << q[i] << ' '; cout << '\n';
//  for(int i = 1; i <= n; ++i) cout << LCP(posa[p[i]], posb[q[i]]) << ' '; cout << '\n';
  bool flag = true, flag2 = false;
  for(int i = 1; i <= n; ++i) if(LCP(posa[p[i]], posb[q[i]]) < m) flag = false;
  if(flag) for(int i = 1; i <= n; ++i) ansp[i] = p[i], ansq[i] = q[i];
  else {
    for(int d = 1; d < m; ++d) {
      memset(head, 0, sizeof(int) * (4 * n + 10)), k = 1;
      memset(deg, 0, sizeof(int) * (4 * n + 10));
      int tot = 0;

      for(int i = 1; i <= 2 * n; ++i) fa[i] = i;
      for(int i = 1; i <= n; ++i) pos[i] = rk[posa[i] + d], pos[i + n] = rk[posb[i]];
      sort(pos + 1, pos + 1 + 2 * n);
      for(int i = 2; i <= n * 2; ++i) if(LCP(sa[pos[i]], sa[pos[i - 1]]) >= m - d) fa[getfa(i)] = getfa(i - 1);
      for(int i = 1; i <= n * 2; ++i) if(fa[i] == i) id[i] = ++tot;
//      for(int i = 1; i <= n; ++i) cout << rk[posa[i] + d] << ' '; cout << '\n';
//      for(int i = 1; i <= n; ++i) cout << rk[posb[i]] << ' '; cout << '\n';
//      for(int i = 1; i <= n * 2; ++i) cout << (sa[pos[i]] + m) / (m + 1) << ' '; cout << '\n';
//      for(int i = 1; i <= n * 2; ++i) cout << id[getfa(i)] << ' '; cout << '\n';
      for(int i = 1; i <= n * 2; ++i) {
        int num = (sa[pos[i]] + m) / (m + 1);
//        cout << num << ' ' << id[getfa(i)] << '\n';
        if(num <= n) add(num, id[getfa(i)] + n * 2);
        else add(id[getfa(i)] + n * 2, num);
//        cout << "s\n";
      }

      for(int i = 1; i <= 2 * n; ++i) fa[i] = i;
      for(int i = 1; i <= n; ++i) pos[i] = rk[posa[i]], pos[i + n] = rk[posb[i] + m - d];
      sort(pos + 1, pos + 1 + 2 * n);
      for(int i = 2; i <= n * 2; ++i) if(LCP(sa[pos[i]], sa[pos[i - 1]]) >= d) fa[getfa(i)] = getfa(i - 1);
      for(int i = 1; i <= n * 2; ++i) if(fa[i] == i) id[i] = ++tot;
//      for(int i = 1; i <= n; ++i) cout << posa[i] << ' '; cout << '\n';
//      for(int i = 1; i <= n; ++i) cout << posb[i] + m - d << ' '; cout << '\n';
//      for(int i = 1; i <= n * 2; ++i) cout << (sa[pos[i]] + m) / (m + 1) << ' '; cout << '\n';
//      for(int i = 1; i <= n * 2; ++i) cout << id[getfa(i)] << ' '; cout << '\n';
      for(int i = 1; i <= n * 2; ++i) {
        int num = (sa[pos[i]] + m) / (m + 1);
        if(num <= n) add(id[getfa(i)] + n * 2, num);
        else add(num, id[getfa(i)] + n * 2);
      }
//      for(int i = 1; i <= n * 2 + tot; ++i) cout << deg[i] << ' '; cout << '\n';

      bool flag3 = false;
      for(int i = 1; i <= n * 2 + tot; ++i) if(deg[i]) flag3 = true;
      if(flag3) continue;
      tp = 0, dfs(1);
      if(tp < 4 * n + 1) continue;
      flag2 = true, reverse(stk + 1, stk + 1 + tp);
//      for(int i = 1; i <= tp; ++i) cout << stk[i] << ' '; cout << '\n';
      for(int i = 1; i <= tp; i += 4) ansp[(i + 3) / 4] = stk[i], ansq[(i + 3) / 4] = stk[i + 2] - n;
      break;
    }
  }
  if(!flag && !flag2) return cout << "-1\n", void();
  for(int i = 1; i <= n; ++i) cout << ansp[i] << ' '; cout << '\n';
  for(int i = 1; i <= n; ++i) cout << ansq[i] << ' '; cout << '\n';
}
int main() {
  ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  cin >> T;
//  T = 1000000;
  while(T--) solve();
  return 0;
}