#include <iostream>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long int ll;
const int N=1e6+9,INF=1e9,M=1e7+9;
const double eps=1e-5;
typedef pair <int,int> PII;
typedef unsigned long long ull;
const ull base=13331;
inline int read()
{
    int x=0,f=1;char c=getchar();
    while(c<'0' || c>'9') {if(c=='-') f=-1;c=getchar();}
    while(c>='0' && c<='9') {x=x*10+c-48,c=getchar();}
    return x*f;
}
inline ll readll()
{
    ll x=0,f=1;char c=getchar();
    while(c<'0' || c>'9') {if(c=='-') f=-1;c=getchar();}
    while(c>='0' && c<='9') {x=x*10+c-48,c=getchar();}
    return x*f;
}
int T,n,m,deg[N],ans[M],cnt,tmp1[N],tmp2[N],c1,c2;
bool vis[M];
ull pw[N];
vector <ull> ha[N],vt;
vector <PII> g[M];
string s;
ull get(int i,int l,int r)
{
    if(l>r) return 0;
    return ha[i][r]-ha[i][l-1]*pw[r-l+1];
}
void dfs(int u)//欧拉回路
{
    for(int i=(int)g[u].size()-1;i>=0;i=(int)g[u].size()-1)
    {
        PII p=g[u][i];
        g[u].pop_back();
        if(vis[p.second]) continue;
        dfs(p.first);
        vis[p.second]=true,ans[++cnt]=p.second;
    }
}
int main()
{
    // #define FILEIO
    #ifdef FILEIO
        freopen("in.in","r",stdin);
        freopen("out.out","w",stdout);
    #endif
    ios::sync_with_stdio(false);
    cin.tie(0);
    pw[0]=1;
    for(int i=1;i<=1000000;i++) pw[i]=pw[i-1]*base;
    cin>>T;
    while(T--)
    {
        bool res=false;
        cin>>n>>m;
        cnt=c1=c2=0;
        for(int i=1;i<=2*n;i++)
        {
            cin>>s;
            ha[i].clear(),ha[i].resize(m+1);
            for(int j=1;j<=m;j++) ha[i][j]=ha[i][j-1]*base+s[j-1]-'a';
        }
        ull B=(base<<15);
        for(int i=0;i<m;i++)
        {
            vt.clear();
            for(int j=1;j<=n;j++)
            {
                ull a=get(j,1,i),b=get(j,i+1,m)+B;
                vt.push_back(a),vt.push_back(b);
            }
            for(int j=n+1;j<=n*2;j++)
            {
                ull a=get(j,1,m-i)+B,b=get(j,m-i+1,m);
                vt.push_back(a),vt.push_back(b);
            }
            sort(vt.begin(),vt.end());
            vt.erase(unique(vt.begin(),vt.end()),vt.end());
            int start=0,s=vt.size();
            for(int j=1;j<=s;j++) deg[j]=0,g[j].clear();
            for(int j=1;j<=n;j++)
            {
                ull a=get(j,1,i),b=get(j,i+1,m)+B;
                int p=lower_bound(vt.begin(),vt.end(),a)-vt.begin()+1;
                int q=lower_bound(vt.begin(),vt.end(),b)-vt.begin()+1;
                deg[p]++,deg[q]--,g[p].push_back({q,j}),start=p;
            }
            for(int j=n+1;j<=n*2;j++)
            {
                ull a=get(j,1,m-i)+B,b=get(j,m-i+1,m);
                int p=lower_bound(vt.begin(),vt.end(),a)-vt.begin()+1;
                int q=lower_bound(vt.begin(),vt.end(),b)-vt.begin()+1;
                deg[p]++,deg[q]--,g[p].push_back({q,j});
            }
            bool flag=true;
            for(int j=1;j<=s && flag;j++)
                if(deg[j]!=0) flag=false;//出度与入度不等
            if(flag==false) continue;
            cnt=0;
            for(int j=1;j<=2*n;j++) vis[j]=false;
            dfs(start);
            for(int j=1;j<=2*n && flag;j++)
                if(vis[j]==false) flag=false;
            if(flag==false) continue;
            c1=c2=0;
            for(int j=cnt;j>=1;j--)
            {
                if(ans[j]>n) tmp2[++c2]=ans[j]-n;
                else tmp1[++c1]=ans[j];
            }
            for(int j=1;j<=c1;j++) cout<<tmp1[j]<<" ";
            cout<<'\n';
            for(int j=1;j<=c2;j++) cout<<tmp2[j]<<" ";
            cout<<'\n';
            res=true;
            break;
        }
        if(res==false) cout<<"-1"<<'\n';
    }
    cerr<<endl<<1e3*clock()/CLOCKS_PER_SEC<<"ms";
    return 0;
}