#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;

const int N=1e6+3,base=1000;
ull pw[N];
void solve(){
    int n,m;
    cin>>n>>m;
    vector<string> a(n+1);
    vector<string> b(n+1);
    vector<vector<ull>> ha(n+1,vector<ull>(m+1));
    vector<vector<ull>> hb(n+1,vector<ull>(m+1));
    for(int i=1;i<=n;++i){
        cin>>a[i],a[i]=" "+a[i];
        for(int j=1;j<=m;++j)
            ha[i][j]=ha[i][j-1]*base+a[i][j];
    }
    for(int i=1;i<=n;++i){
        cin>>b[i],b[i]=" "+b[i];
        for(int j=1;j<=m;++j)
            hb[i][j]=hb[i][j-1]*base+b[i][j];
    }
    auto hasha=[=](int i,int l,int r) -> ull {
        return ha[i][r]-ha[i][l-1]*pw[r-l+1];
    };
    auto hashb=[=](int i,int l,int r) -> ull {
        return hb[i][r]-hb[i][l-1]*pw[r-l+1];
    };
    vector<ull> pr(n+1),sf(n+1);
    map<ull,int> mp1,mp2;
    int cnt1,cnt2,cnte,top;
    vector<int> fir(2*n+1),to(2*n+1),nxt(2*n+1);
    vector<int> ind(2*n+1),outd(2*n+1),st(2*n+1),mark(2*n+1);
    auto adde=[&](int x,int y) -> void {
        to[++cnte]=y,nxt[cnte]=fir[x],fir[x]=cnte;
        ind[y]++;
        outd[x]++;
    };
    auto check=[&](int k) -> bool {
        for(int i=1;i<=2*n;++i)fir[i]=ind[i]=outd[i]=mark[i]=0;
        cnte=0,cnt1=0,cnt2=n;
        mp1.clear(),mp2.clear();
        for(int i=1;i<=n;++i){
            pr[i]=hasha(i,1,k);
            if(!mp1.count(pr[i]))mp1[pr[i]]=++cnt1;
            sf[i]=hasha(i,k+1,m);
            if(!mp2.count(sf[i]))mp2[sf[i]]=++cnt2;
            adde(mp1[pr[i]],mp2[sf[i]]);
        }
        for(int i=1;i<=n;++i){
            ull pr=hashb(i,1,m-k);
            ull sf=hashb(i,m-k+1,m);
            if(!mp2.count(pr)||!mp1.count(sf)){
                return 0;
            }
            adde(mp2[pr],mp1[sf]);
        }
        for (int i=1;i<=2*n;i++){
            if (ind[i]!=outd[i]) return 0;
        }
        top=0;
        function<void(int)> dfs=[&](int u){
            for(int &i=fir[u];i;i=nxt[i])if(!mark[i]){
                mark[i]=i;
                int j=i;
                dfs(to[i]);
                st[++top]=j;
            }
        };
        dfs(1);
        if(top!=2*n)return 0;
        for(int i=top;i>=2;i-=2)cout<<st[i]<<' ';
        cout<<'\n';
        for(int i=top-1;i>=1;i-=2)cout<<st[i]-n<<' ';
        cout<<'\n';
        return 1;
    };
    for(int i=1;i<=m;++i){
        if(check(i))return;
    }
    cout<<"-1\n";
}

int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    int n=1e6;
    pw[0]=1;
    for(int i=1;i<=n;++i)pw[i]=pw[i-1]*base;
    int T;
    cin>>T;
    while(T--)solve();
    return 0;
}