#include <bits/stdc++.h>
#define pb push_back
#define ALL(tar) tar.begin(), tar.end()
#define forn(name, b, n) for (int name = (b); name <= (int)(n); name++)
#define competition cin.tie(0), cout.tie(0), ios::sync_with_stdio(false)
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pair<int, ii> > EdgeList;
const ll INF = 0x3f3f3f3f;
const ll MS = 2e6+10;
ll MOD=1e18+3,base=131,pw[MS];
int n,m;
vector<ll> sufa[MS],sufb[MS],prea[MS],preb[MS],dfn;
string sa[MS],sb[MS];
ll mul(ll a,ll b){
	return (__int128)a*b%MOD;
}
ll add(ll a,ll b){
	return (a+b)%MOD;
}
ll sub(ll a,ll b){
	return (a+MOD-b)%MOD;
}
void getpre(string & str,vector<ll> &ha){
	ha.resize(m+2);
	ha[0]=0;
	forn(i,1,m){
		ha[i]=add(mul(ha[i-1],base),str[i-1]);
	}
}
void getsuf(string & str,vector<ll> &ha){
	ha.resize(m+2);
	ha[m+1]=0;
	for(int i=m;i>=1;--i){
		ha[i]=add(ha[i+1],mul(str[i-1],pw[m-i]));
	}
}
int fa[MS],de[MS],now,ecnt,vis[MS];
map<ll,int> na;
int getid(ll h){
	if(!na.count(h)){
		na[h]=++now;
		fa[now]=now;
	}
	return na[h];
}
vii g[MS];
int findf(int u){
	return u==fa[u]?u:fa[u]=findf(fa[u]);
}
void add(int u,int v){
	++ecnt;
	fa[findf(u)]=findf(v);
	de[u]++,de[v]--;
	g[u].pb({v,ecnt});
}
void dfs(int u){
	for(auto [v,id]:g[u]){
		if(vis[id])continue;
		dfn.pb(id);
		vis[id]=1;
		dfs(v);
	}
}
void solve()
{
	cin>>n>>m;
	pw[0]=1;
	forn(i,1,m)pw[i]=mul(pw[i-1],base);
	forn(i,1,n)cin>>sa[i],getpre(sa[i],prea[i]),getsuf(sa[i],sufa[i]);
	forn(i,1,n)cin>>sb[i],getpre(sb[i],preb[i]),getsuf(sb[i],sufb[i]);
	forn(len,0,m-1){
			vi a,b;
		forn(i,1,now)g[i].clear(),de[i]=0;
		now=0;
		na.clear();
	
		forn(i,1,ecnt)vis[i]=0;
		ecnt=0;
		dfn.clear();
		forn(i,1,n){
			ll hl=prea[i][len],hr=sufa[i][len+1]+MOD;
			int u=getid(hl),v=getid(hr);
			add(u,v);
		}
		forn(i,1,n){
			ll hl=preb[i][m-len]+MOD,hr=sufb[i][m-len+1];
			int u=getid(hl),v=getid(hr);
			add(u,v);
		}
		assert(ecnt==2*n);
		int ok=1;
		forn(i,1,now)if(findf(1)!=findf(i))ok=0;
		forn(i,1,now)if(de[i]){
			ok=0;
		}
		if(!ok)continue;
//		puts("1");
//		return;
		dfs(1);
	
		for(auto v:dfn)if(v<=n)a.pb(v);
		else b.pb(v);
		assert(a.size()==n);
		assert(b.size()==n);
		for(auto v:a)printf("%d ",v);puts("");
		for(auto v:b)printf("%d ",v-n);puts("");
		return;
	}
	puts("-1");
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	int t=1;
	cin>>t;
	while(t--)
		solve();
}
/*
1
1 50
cccccccccccccccccccbbbbbbbbbbbbbbbbbbbbbbbbbbaaaac
bbbbbbbbbbbbbbbbbbbbbbbbbbbaaacccccccccccccccccccc
*/