#include<bits/stdc++.h>
using namespace std;
constexpr int maxn=2e6+5;
int n,m;
vector<pair<int,int>> e[maxn];
typedef unsigned long long ull;
mt19937 rnd(time(0));
const ull base=rnd()%100+233,mod=100000007998244353;
ull bs[maxn];
vector<ull> hs[maxn][2];
vector<int> ans;
void dfs(int p){
    while(!e[p].empty()){
        auto x=e[p].back();e[p].pop_back();
        dfs(x.first);
        ans.push_back(x.second);
    }
}
int deg[maxn];
inline void solve(){
    cin>>n>>m;for(int _:{0,1}){
        for(int i=1;i<=n;i++){
            string s;cin>>s;
            ull cur=0;hs[i][_].clear();hs[i][_].push_back(cur);
            for(auto x:s) hs[i][_].push_back(cur=(cur*base+x)%mod);
        }
    }
    for(int t=0;t<m;t++){
        ans.clear();
        // cout<<"1233 "<<t<<'\n';
        unordered_map<ull,int> p[2];
        int tot=0;
        auto get=[&](int op,ull x){
            // cout<<op<<' '<<x<<'\n';
            if(p[op].count(x)) return p[op][x];
            else return p[op][x]=++tot;
        };
        for(int i=1;i<=n;i++){
            ull x=hs[i][0][t],y=(hs[i][0][m]+mod-hs[i][0][t]*bs[m-t]%mod)%mod;
            int xx=get(0,x),yy=get(1,y);
            // cout<<i<<' '<<xx<<' '<<yy<<'\n';
            e[xx].push_back(make_pair(yy,i));deg[yy]++;
        }
        for(int i=1;i<=n;i++){
            ull x=hs[i][1][m-t],y=(hs[i][1][m]+mod-hs[i][1][m-t]*bs[t]%mod)%mod;
            int xx=get(1,x),yy=get(0,y);
            e[xx].push_back(make_pair(yy,-i));deg[yy]++;
        }
        bool f=1;
        for(int i=1;i<=tot;i++) {if(e[i].size()!=deg[i]) f=0;deg[i]=0;}
        dfs(1);
        // for(auto x:ans) cout<<x<<' ';cout<<'\n';
        for(int i=1;i<=tot;i++)e[i].clear();
        if(!f) continue;
        if(ans.size()==2*n){
            reverse(ans.begin(),ans.end());
            vector<int> u,v;
            for(auto x:ans) (x>0?u:v).push_back(abs(x));
            assert(u.size()==v.size());
            for(auto x:u) cout<<x<<' ';cout<<'\n';
            for(auto y:v) cout<<y<<' ';cout<<'\n';
            return;
        }
    }
    cout<<"-1\n";
}
int main(){
    std::ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int T;cin>>T;
    for(int i=bs[0]=1;i<=maxn-5;i++) bs[i]=bs[i-1]*base%mod;
    while(T--) solve();
}