#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
string a[N], b[N];
#define ull unsigned long long
int n, m;
vector<ull> ahs_pre[N], bhs_pre[N];
vector<ull> ahs_suf[N], bhs_suf[N];
const ull BS = 1919810, M = 5020100709000001;
ull pw[1000300];
vector<pair<int, int>> g[2 * N];
inline bool prt(vector<int> A) {
    if (A.size() != 2 * n) return 0;
    int w = A[0] > n;
    for (int i = w; i < 2 * n; i += 2) cout << A[i] << " ";
    cout << endl;
    for (int i = !w; i < 2 * n; i += 2) cout << A[i] - n << " ";
    cout << endl;
    return 1;
}
vector<int> A;
inline void dfs(int u) {
    while (!g[u].empty()) {
        auto [v, id] = g[u].back();
        g[u].pop_back();
        dfs(v);
        A.push_back(id);
    }
}
int ic[2 * N], oc[2 * N];

void solve() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        ahs_pre[i].resize(m + 1);
        ahs_suf[i].resize(m + 1);
        ahs_pre[i][0] = 0;
        for (int j = 0; j < m; j++)
            ahs_pre[i][j + 1] = (ahs_pre[i][j] + pw[j] * a[i][j]) % M;
        ahs_suf[i][m] = 0;
        for (int j = m - 1; j >= 0; j--)
            ahs_suf[i][j] = (ahs_suf[i][j + 1] * BS + a[i][j]) % M;
    }
    for (int i = 1; i <= n; i++) {
        cin >> b[i];
        bhs_pre[i].resize(m + 1);
        bhs_suf[i].resize(m + 1);
        bhs_pre[i][0] = 0;
        for (int j = 0; j < m; j++)
            bhs_pre[i][j + 1] = (bhs_pre[i][j] + pw[j] * b[i][j]) % M;
        bhs_suf[i][m] = 0;
        for (int j = m - 1; j >= 0; j--)
            bhs_suf[i][j] = (bhs_suf[i][j + 1] * BS + b[i][j]) % M;
    }
    map<ull, int> mp;
    int cnt = 0;
    bool ok = 0;
    for (int lim = 0; lim < m; lim++) {
        mp.clear();
        cnt = 0;

        for (int i = 1; i <= n; i++) {
            int l = ahs_pre[i][lim], r = ahs_suf[i][lim];
            if (m - lim == lim) r = r * BS + '*', r %= M;
            if (!mp.count(l)) mp[l] = ++cnt;
            if (!mp.count(r)) mp[r] = ++cnt;
            g[mp[l]].push_back({mp[r], i});
            oc[mp[l]]++, ic[mp[r]]++;
        }

        for (int i = 1; i <= n; i++) {
            int l = bhs_pre[i][m - lim], r = bhs_suf[i][m - lim];
            if (m - lim == lim) l = l * BS + '*', l %= M;
            if (!mp.count(l)) mp[l] = ++cnt;
            if (!mp.count(r)) mp[r] = ++cnt;
            g[mp[l]].push_back({mp[r], i + n});
            oc[mp[l]]++, ic[mp[r]]++;
        }
        A.clear();
        dfs(1);
        reverse(A.begin(), A.end());
        for (int i = 1; i <= cnt; i++) g[i].clear();
        bool op = 1;
        for (int i = 1; i <= cnt; i++) op &= ic[i] == oc[i], ic[i] = oc[i] = 0;
        if (op && prt(A)) {
            ok = 1;
            break;
        }
    }
    if (!ok) cout << -1 << endl;
}

signed main() {
    ios::sync_with_stdio(0);
    int t;
    cin >> t;
    pw[0] = 1;
    for (int i = 1; i <= 1e6; i++) pw[i] = pw[i - 1] * BS % M;
    int pt = t;
    while (t--) {
        solve();
    }
    return 0;
}