#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 4000005;
const int B = 131;
const int P0 = 1000000009;
const int P1 = 998244353;

int pwr(int x,int y,int MOD){
    int r = 1,t = x;
    while(y){
        if(y & 1) r = 1ll * r * t % MOD;
        t = 1ll * t * t % MOD;
        y >>= 1;
    }
    return r;
}

int invb0 = pwr(B,P0 - 2,P0);
int invb1 = pwr(B,P1 - 2,P1);

int n,m,in[N];
string s[N],t[N];
vector <pair <int,int> > hs[N],ht[N];

inline pair <int,int> getvals(int id,int l,int r){
    if(l > r) return make_pair(0,0);
    return make_pair(1ll * pwr(invb0,l - 1,P0) * (hs[id][r].first - hs[id][l - 1].first + P0) % P0 , 1ll * pwr(invb1,l - 1,P1) * (hs[id][r].second - hs[id][l - 1].second + P1) % P1);
}
inline pair <int,int> getvalt(int id,int l,int r){
    if(l > r) return make_pair(0,0);
    return make_pair(1ll * pwr(invb0,l - 1,P0) * (ht[id][r].first - ht[id][l - 1].first + P0) % P0 , 1ll * pwr(invb1,l - 1,P1) * (ht[id][r].second - ht[id][l - 1].second + P1) % P1);
}

vector <pair <int,int> > G[N << 1];
int cur[N << 1],vis[N << 2];
int stk[N << 2],tp;
void dfs(int u,int ind){
    // cout << u << ' ' << ind << ' ' << cur[u] << endl;
    for(int &i = cur[u];i < G[u].size();i ++){
        // cur[u] ++;
        if(vis[G[u][i].second + n]) continue;
        vis[G[u][i].second + n] = 1;
        dfs(G[u][i].first,G[u][i].second);
    }
    stk[++ tp] = ind;
}

bool solve(){
    cin >> n >> m;
    for(int i = 1;i <= n;i ++){
        cin >> s[i];
        s[i] = ' ' + s[i];
        hs[i].clear(); hs[i].push_back(make_pair(0,0));
        for(int j = 1;j <= m;j ++) hs[i].push_back(make_pair((hs[i].back().first + 1ll * pwr(B,j - 1,P0) * s[i][j]) % P0,(hs[i].back().second + 1ll * pwr(B,j - 1,P1) * s[i][j]) % P1));
    }
    for(int i = 1;i <= n;i ++){
        cin >> t[i];
        t[i] = ' ' + t[i];
        ht[i].clear(); ht[i].push_back(make_pair(0,0));
        for(int j = 1;j <= m;j ++) ht[i].push_back(make_pair((ht[i].back().first + 1ll * pwr(B,j - 1,P0) * t[i][j]) % P0,(ht[i].back().second + 1ll * pwr(B,j - 1,P1) * t[i][j]) % P1));
    }
    for(int l = 0;l < m;l ++){
        int tot = 0;
        map <pair <int,int>,int> mp[2];
        for(int i = 1;i <= n;i ++){
            pair <int,int> il = getvals(i,1,l),ir = getvals(i,l + 1,m); // l & m - l
            if(mp[0].find(il) == mp[0].end()) mp[0][il] = ++ tot;
            if(mp[1].find(ir) == mp[1].end()) mp[1][ir] = ++ tot;
            G[mp[0][il]].push_back(make_pair(mp[1][ir],i));
            in[mp[1][ir]] ++;
            // cout << mp[0][il] << ',' << mp[1][ir] << ',' << i << endl;
        }
        for(int i = 1;i <= n;i ++){
            pair <int,int> il = getvalt(i,1,m - l),ir = getvalt(i,m - l + 1,m); // m - l & l
            if(mp[1].find(il) == mp[1].end()) mp[1][il] = ++ tot;
            if(mp[0].find(ir) == mp[0].end()) mp[0][ir] = ++ tot;
            G[mp[1][il]].push_back(make_pair(mp[0][ir],-i));
            in[mp[0][ir]] ++;
            // cout << mp[1][il] << ',' << mp[0][ir] << ',' << -i << endl;
        }
        int fl = 0;
        for(int i = 1;i <= tot;i ++) if(in[i] != G[i].size()) fl = 1;
        for(int i = 1;i <= tot;i ++) cur[i] = in[i] = 0;
        // cout << "FL = " << fl << endl;
        if(fl){
            for(int i = 1;i <= tot;i ++) G[i].clear();
            continue;
        }
        tp = 0; dfs(1,0);
        for(int i = 1;i <= tot;i ++) G[i].clear();
        for(int i = 0;i <= n + n;i ++) vis[i] = 0;
        // for(int i = 1;i <= tp;i ++) cout << stk[i] << " \n"[i == tp];
        if(tp != n + n + 1) continue;
        for(int i = tp;i >= 1;i --) if(stk[i] > 0) cout << stk[i] << ' ';
        cout << '\n';
        for(int i = tp;i >= 1;i --) if(stk[i] < 0) cout << -stk[i] << ' ';
        cout << '\n';
        return 1;
    }
    return 0;
}

int main(){
    ios::sync_with_stdio(false);
    int TC;
    cin >> TC;
    while(TC --){
        if(!solve()) cout << -1 << '\n';
    }
    return 0;
}