#include<bits/stdc++.h>
#define endl "\n"
using namespace std;
#define int long long
using ll = long long;
const int inf = 1e9+7, N = 4e6+5, mod = 1e9 + 7;
typedef pair<int, int> P;
const int B=131;
int p[N],in[N],ou[N];
int iter[N];
vector<P>e[N];
bool vis[N>>1];
void init(){
    p[0]=1;
    for(int i=1;i<=N-1;i++)
        p[i]=p[i-1]*B%mod;
    return;
}

void solve(){
    int n,m;
    cin>>n>>m;
    vector<vector<vector<int>>>h(2,vector<vector<int>>(n+1,vector<int>(m+1,0)));
    for(int i=1;i<=n;i++){
        string s;cin>>s;
        for(int j=1;j<=m;j++){
            h[0][i][j]=(h[0][i][j-1]*B%mod+s[j-1])%mod;
        }
    }
    for(int i=1;i<=n;i++){
        string s;cin>>s;
        for(int j=1;j<=m;j++)
            h[1][i][j]=(h[1][i][j-1]*B%mod+s[j-1])%mod;
    }
    for(int b=0;b<m;b++){
        map<int,int>mp[2];
        int tot=0;
        for(int i=1;i<=n;i++){
            int x=h[0][i][b],y=((h[0][i][m]-x*p[m-b]%mod)%mod+mod)%mod;            //if(b==1&&i==1) cout<<x<<' '<<y<<endl;
            if(mp[0].find(x)==mp[0].end()) mp[0][x]=++tot;
            if(mp[1].find(y)==mp[1].end()) mp[1][y]=++tot;
            x=mp[0][x],y=mp[1][y];
            e[x].push_back({y,i});
            ++ou[x],++in[y];
        }
        for(int i=1;i<=n;i++){
            int x=h[1][i][m-b],y=((h[1][i][m]-x*p[b]%mod)%mod+mod)%mod;            //if(b==1&&i==1) cout<<x<<' '<<y<<endl;
            if(mp[1].find(x)==mp[1].end()) mp[1][x]=++tot;
            if(mp[0].find(y)==mp[0].end()) mp[0][y]=++tot;
            x=mp[1][x],y=mp[0][y];
            e[x].push_back({y,i+n});
            ++ou[x],++in[y];
        }
        bool ok=1;
        for(int i=1;i<=tot;i++){
            if(ou[i]!=in[i]){
                ok=0;
                break;
            }
        }
        if(!ok){
            for(int i=1;i<=tot;i++) e[i].clear(),in[i]=ou[i]=0;;
            tot=0;
            continue;
        }
        for(int i=1;i<=2*n;i++) vis[i]=0;
        for(int i=1;i<=tot;i++) iter[i]=0;
        vector<int>ans;
        function<void(int)>dfs=[&](int u){
            int sz=e[u].size();
            for(int&i=iter[u];i<sz;i++){
                int v=e[u][i].first,id=e[u][i].second;
                if(vis[id])continue;
                vis[id]=1;
                dfs(v);
                ans.push_back(id);
            }
        };
        dfs(1);
        int sz=ans.size();
        for(int i=1;i<=2*n;i++) vis[i]=0;
        for(int i=1;i<=tot;i++) iter[i]=0;
        if(sz!=2*n){
            for(int i=1;i<=tot;i++) e[i].clear(),in[i]=ou[i]=0;;
            tot=0;
            continue;
        }
        vector<int>u,v;
        for(int i=sz-1;i>=0;i--){
            if(ans[i]<=n) u.push_back(ans[i]);
            else v.push_back(ans[i]-n);
        }
        if(u.size()==n){
            for(auto&it:u) cout<<it<<' ';cout<<endl;
            for(auto&it:v) cout<<it<<' ';cout<<endl;
            for(int i=1;i<=tot;i++) e[i].clear(),in[i]=ou[i]=0;;
            tot=0;   
            return;
        }
        for(int i=1;i<=tot;i++) e[i].clear(),in[i]=ou[i]=0;
        tot=0;
    }
    cout<<-1<<endl;
    return;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    init();
    int t = 1;cin>>t;
    while (t--)solve();
    return 0;
}