#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod1=1000000009,mod2=1000099999,MAX=2000005,INF=1<<30;

struct Rollinghash{
    string S;
    int n;
    int base1;
    int base2;
    vector<ll> h1,h2,ru1,ru2;
    
    void make(string &T,int ba1,int ba2){
        S=T;
        n=S.size();
        h1.assign(n+1,0);
        h2.assign(n+1,0);
        ru1.assign(n+1,0);
        ru2.assign(n+1,0);
        base1=ba1;
        base2=ba2;
        
        ru1[0]=1;
        ru2[0]=1;
        
        for(int i=1;i<=n;i++){
            h1[i]=h1[i-1]*base1+ll(S[i-1]-'A');
            h1[i]%=mod1;
            
            h2[i]=h2[i-1]*base2+ll(S[i-1]-'A');
            h2[i]%=mod2;
            
            ru1[i]=ru1[i-1]*base1%mod1;
            ru2[i]=ru2[i-1]*base2%mod2;
        }
    }
    
    pair<ll,ll> ha(int l,int r){
        pair<ll,ll> res;
        res.fi=(h1[r]-h1[l]*ru1[r-l]%mod1+mod1)%mod1;
        res.se=(h2[r]-h2[l]*ru2[r-l]%mod2+mod2)%mod2;
        
        return res;
    }//開区間
};


vector<pair<int,int>> G[MAX];
bool visited[2*MAX];

void DFS(int u, vector<int> &trail) {
    while(!G[u].empty()) {
        int v=G[u].back().fi,id=G[u].back().se;
        G[u].pop_back();
        
        if(visited[id]) continue;
        
        visited[id]=1;
        
        trail.push_back(id);
        
        DFS(v,trail);
    }
    //trail.push_back(u);
}


int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    
    ll ha1=rng()%mod1;
    ll ha2=rng()%mod2;
    
    int Q;cin>>Q;
    while(Q--){
        int N,M;cin>>N>>M;
        vector<string> S(N),T(N);
        for(int i=0;i<N;i++) cin>>S[i];
        for(int i=0;i<N;i++) cin>>T[i];
        
        {
            vector<pair<string,int>> A(N),B(N);
            for(int i=0;i<N;i++) A[i]=mp(S[i],i);
            for(int i=0;i<N;i++) B[i]=mp(T[i],i);
            sort(all(A));
            sort(all(B));
            bool ch=true;
            for(int i=0;i<N;i++) ch&=(A[i].fi==B[i].fi);
            
            if(ch){
                for(int i=0;i<N;i++) cout<<A[i].se+1<<" ";
                cout<<endl;
                for(int i=0;i<N;i++) cout<<B[i].se+1<<" ";
                cout<<endl;
                continue;
            }
        }
        
        vector<Rollinghash> rol(2*N);
        for(int i=0;i<N;i++){
            rol[i].make(S[i],ha1,ha2);
        }
        for(int i=0;i<N;i++){
            rol[N+i].make(T[i],ha1,ha2);
        }
        
        vector<int> ans1,ans2;
        
        for(int al=1;al<M;al++){
            vector<pair<pair<ll,ll>,int>> use;
            for(int i=0;i<N;i++){
                use.push_back(mp(rol[i].ha(0,al),0));
                use.push_back(mp(rol[i].ha(al,M),1));
            }
            for(int i=0;i<N;i++){
                use.push_back(mp(rol[N+i].ha(0,M-al),1));
                use.push_back(mp(rol[N+i].ha(M-al,M),0));
            }
            
            sort(all(use));
            use.erase(unique(all(use)),use.end());
            
            int K=si(use);
            
            auto f=[&](pair<pair<ll,ll>,int> x){
                return (int)(lower_bound(all(use),x)-use.begin());
            };
            
            for(int i=0;i<N;i++){
                int s=f(mp(rol[i].ha(0,al),0)),t=f(mp(rol[i].ha(al,M),1));
                G[s].push_back(mp(t,i));
            }
            for(int i=0;i<N;i++){
                int s=f(mp(rol[N+i].ha(0,M-al),1)),t=f(mp(rol[N+i].ha(M-al,M),0));
                G[s].push_back(mp(t,N+i));
            }
            
            vector<int> tr;
            
            DFS(0,tr);
            
            for(int i=0;i<K;i++){
                G[i].clear();
                visited[2*i]=visited[2*i+1]=false;
            }
            
            if(si(tr)==N+N){
                for(int i=0;i<2*N;i++){
                    if(i%2==0) ans1.push_back(tr[i]);
                    else ans2.push_back(tr[i]);
                }
                
                break;
            }
        }
        
        if(si(ans1)==0) cout<<-1<<"\n";
        else{
            if(ans1[0]>=N) swap(ans1,ans2);
            for(int a:ans1) cout<<a+1<<" ";
            cout<<endl;
            for(int a:ans2) cout<<a+1-N<<" ";
            cout<<endl;
        }
    }
}