#include <ctime>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <unordered_map>
#pragma GCC optimize(2)
#define ll long long

using namespace std;

ll P;
const ll D = 131;
int T;
int N;
int M;
vector<ll> SA1[1000009];
vector<ll> SB1[1000009];
vector<int> idA1[1000009];
vector<int> idA2[1000009];
vector<int> idB1[1000009];
vector<int> idB2[1000009];
char s[1000009];
struct Node {
    int v;
    int id;
};
ll PD[1000009];
vector<Node> E[2000009];
int deg2[2000009];
int idx;
unordered_map<ll, int> SA;
unordered_map<ll, int> SB;
int ba[2000009];
int n;
bool va[2000009];
int res[2000009];
int nn;
int resa[1000009];
int resb[1000009];
int a;
int b;

void Dfs (int x) {
    Node v;
    while (!E[x].empty()) {
        v = E[x].back(), E[x].pop_back();
        Dfs(v.v);
        res[++nn] = v.id;
    }
}

bool Chk (ll x) {
    for (ll i = 2; i * i <= x; i++)
        if (!(x % i)) return false;
    return true;
}

int main () {
    ll s2;
    bool f;
    bool ff;
    PD[0] = 1;
    srand(time(0));
    P = 2e9 + rand();
    while (!Chk(P)) P++;
    for (int i = 1; i <= 1000000; i++) PD[i] = (PD[i - 1] * D) % P;
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d", &N, &M);
        SA.clear(), SB.clear(), idx = 0;
        for (int i = 1; i <= N; i++) {
            scanf("%s", s + 1);
            idA1[i].clear(), idA2[i].clear();
            SA1[i].clear();
            s2 = 0;
            idA1[i].push_back(0), idA2[i].push_back(0);
            SA1[i].push_back(0);
            for (int j = 1; j <= M; j++) {
                s2 = (s2 + PD[j - 1] * (ll)(s[M - j + 1] - 'a' + 1)) % P;
                SA1[i].push_back((SA1[i].back() * D + (ll)(s[j] - 'a' + 1)) % P);
                a = SA[s2];
                if (!a) a = SA[s2] = ++idx;
                idA2[i].push_back(a);
            }
        }
        for (int i = 1; i <= N; i++) {
            scanf("%s", s + 1);
            idB1[i].clear(), idB2[i].clear();
            SB1[i].clear();
            s2 = 0;
            idB1[i].push_back(0), idB2[i].push_back(0);
            SB1[i].push_back(0);
            for (int j = 1; j <= M; j++) {
                s2 = (s2 + PD[j - 1] * (ll)(s[M - j + 1] - 'a' + 1)) % P;
                SB1[i].push_back((SB1[i].back() * D + (ll)(s[j] - 'a' + 1)) % P);
                a = SB[s2];
                if (!a) a = SB[s2] = ++idx;
                idB2[i].push_back(a);
            }
        }
        for (int i = 1; i <= N; i++)
            for (int j = 1; j <= M; j++) {
                if (!SB.count(SA1[i][j])) idA1[i].push_back(-1);
                else idA1[i].push_back(SB[SA1[i][j]]);
                if (!SA.count(SB1[i][j])) idB1[i].push_back(-1);
                else idB1[i].push_back(SA[SB1[i][j]]);
            }
        f = false;
        for (int i = 1; i <= M; i++) {
            for (int j = 1; j <= n; j++) E[ba[j]].clear(), va[ba[j]] = deg2[ba[j]] = 0;
            n = 0;
            ff = true;
            for (int j = 1; j <= N; j++) {
                a = idA1[j][i], b = idA2[j][M - i];
                if (a < 0) {
                    ff = false;
                    break;
                }
                if (!va[a]) va[a] = true, ba[++n] = a;
                if (!va[b]) va[b] = true, ba[++n] = b;
                E[a].push_back({b, j});
                deg2[b]++;
                a = idB1[j][M - i], b = idB2[j][i];
                if (a < 0) {
                    ff = false;
                    break;
                }
                if (!va[a]) va[a] = true, ba[++n] = a;
                if (!va[b]) va[b] = true, ba[++n] = b;
                E[a].push_back({b, j + N});
                deg2[b]++;
            }
            if (ff) {
                f = true;
                for (int j = 1; j <= n; j++)
                    if (deg2[ba[j]] != E[ba[j]].size()) {
                        f = false;
                        break;
                    }
                if (!f) continue;
                nn = 0;
                Dfs(ba[1]);
                if (nn < 2 * N) {
                    f = false;
                    continue;
                }
                a = b = 0;
                for (int j = nn; j; j--)
                    if (res[j] <= N) resa[++a] = res[j];
                    else resb[++b] = res[j] - N;
                for (int j = 1; j <= N; j++) printf("%d ", resa[j]);
                puts("");
                for (int j = 1; j <= N; j++) printf("%d ", resb[j]);
                puts("");
                break;
            }
        }
        if (!f) puts("-1");
    }
    return 0;
}