#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const int mod = 998244353;
const int N = 1e6 + 10;

int n, m;
string s[N], t[N];
map<int, vector<int>>mp;
vector<int> e[N << 1];
int pb[N];

const int bas = 131;
void initpb() {
    pb[0] = 1;
    for (int i = 1; i < N; ++i)
        pb[i] = 1ll * pb[i - 1] * bas % mod;
}
struct HASH {
    ll bas = 131, mod = (1ll << 61) - 1;
    vector<ll>F;
    void init(const string& s) {
        F.resize(m);
        F[0] = s[0];
        for (int i = 1; i < m; ++i)
            F[i] = ((__int128)F[i - 1] * bas + s[i]) % mod;
    }
    ll sub(int l, int r) {
        if (l == 0) return F[r];
        return (F[r] - (__int128)F[l - 1] * pb[r - l + 1] % mod + mod) % mod;
    }
};

HASH hs[N], ht[N];

int in[N << 1];

void getedge(int len) {
    mp.clear();
    for (int i = 1; i <= n << 1; ++i) e[i].clear();
    for (int i = 1; i <= n; ++i)
        mp[hs[i].sub(m - len, m - 1)].push_back(i);
    for (int i = 1; i <= n; ++i) {
        vector<int>& p = mp[ht[i].sub(0, len - 1)];
        if (!p.empty()) {
            for (int v : p) {
                e[v].push_back(n + i);
                ++in[n + i];
            }
        }
    }
    mp.clear();
    if (len == m) return;
    len = m - len;
    for (int i = 1; i <= n; ++i)
        mp[ht[i].sub(m - len, m - 1)].push_back(i);
    for (int i = 1; i <= n; ++i) {
        vector<int>& p = mp[hs[i].sub(0, len - 1)];
        if (!p.empty()) {
            for (auto v : p) {
                e[v + n].push_back(i);
                ++in[i];
            }
        }
    }
}

int p[N], q[N];
bool check() {
    iota(p + 1, p + n + 1, 1);
    iota(q + 1, q + n + 1, 1);
    sort(p + 1, p + n + 1, [&](int x, int y) { return hs[x].F < hs[y].F; });
    sort(q + 1, q + n + 1, [&](int x, int y) { return ht[x].F < ht[y].F; });
    for (int i = 1; i <= n; ++i)
        if (hs[p[i]].F != ht[q[i]].F)
            return 0;
    for (int i = 1; i <= n; ++i) cout << p[i] << ' '; cout << '\n';
    for (int i = 1; i <= n; ++i) cout << q[i] << ' '; cout << '\n';
    return 1;
}


int stk[N << 1], top;
int del[N << 1];
bool vis[N << 1];
// void dfs(int u) {
//     del[u] = 1;
//     stk[++top] = u;
//     for (auto v : e[u])
//         if (!del[v])
//             dfs(v);
// }

void dfs(int cur) {
    vis[cur] = 1;
    for (int i = del[cur]; i < e[cur].size(); i = del[cur]) {
        del[cur] = i + 1;
        if (vis[e[cur][i]])continue;
        dfs(e[cur][i]);
    }
    stk[++top] = cur;
}
void MAIN() {
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) cin >> s[i];
    for (int i = 1; i <= n; ++i) cin >> t[i];
    for (int i = 1; i <= n; ++i) hs[i].init(s[i]);
    for (int i = 1; i <= n; ++i) ht[i].init(t[i]);
    if (check()) return;
    for (int len = 1; len < m; ++len) {
        memset(in + 1, 0, sizeof(int) * n * 2);
        getedge(len);
        bool flag = true;
        for (int i = 1; i <= n << 1; ++i)
            if (in[i] != e[i].size() || !in[i] || e[i].empty()) {
                flag = false;
                break;
            }
        if (!flag)continue;
        del[0] = 1;
        // for (int i = 1; i <= n << 1; ++i) del[i] = 0;
        memset(vis + 1, 0, sizeof(bool) * n * 2);
        memset(del + 1, 0, sizeof(int) * n * 2);
        top = 0;
        dfs(1);
        if (top == (n << 1)) {
            // cout << "YES\n";
            reverse(stk + 1, stk + top + 1);
            for (int i = 1; i <= top; i += 2) cout << stk[i] << ' '; cout << '\n';
            for (int i = 2; i <= top; i += 2) cout << stk[i] - n << ' '; cout << '\n';
            return;
        }
    }
    cout << "-1\n";
}

int main() {
#ifdef LOCAL
    freopen("in.in", "r", stdin);
    freopen("out.out", "w", stdout);
#endif
    std::ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    initpb();
    int T = 1;
    cin >> T;
    while (T--)
        MAIN();
    return 0;
}