#include<bits/stdc++.h>
using namespace std;
mt19937 mt(time(NULL));
typedef long long ll;
constexpr int M=2e6+5;
constexpr ll delta=998244353;
constexpr int mod=998244353;
vector<ll>pre1[M>>1],pre2[M>>1];ll pw[M];char s[M];
int n,m,T,Index,bas,f[M],in[M],ou[M];unordered_map<ll,int>mp;
vector<pair<int,int>>g[M];vector<int>ans,ans1,ans2;
int read(){
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)) {if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x*f;
}
int idx(ll x){
	if (!mp[x]) return mp[x]=++Index;
	return mp[x];
}
void dfs(int x){
	while (!g[x].empty()){
		const int tmp1=g[x].back().first,
				  tmp2=g[x].back().second;
		g[x].pop_back();dfs(tmp1);ans.push_back(tmp2);
	}
}
int find(int x){return f[x]==x?x:f[x]=find(f[x]);}
bool check(){
	const int n=Index;int cnt=0;
	for (int i=1;i<=n;i++) f[i]=i,in[i]=ou[i]=0;
	for (int i=1;i<=n;i++)
		for (auto k:g[i]){
			const int j=k.first;
			in[j]++;ou[i]++;f[find(i)]=find(j);
		}
	for (int i=1;i<=n;i++)
		cnt+=find(i)==i;
	if (cnt>1) return 0;
	for (int i=1;i<=n;i++)
		if (in[i]^ou[i]) return 0;
	ans.clear();dfs(1);reverse(ans.begin(),ans.end());return 1;
}
void solve(){
	scanf("%d%d",&n,&m);
    bas=mt()%mod;
    while (bas<=114514) bas=mt()%mod;
	for (int i=pw[0]=1;i<=m;i++) pw[i]=pw[i-1]*bas%mod;
	for (int i=1;i<=n;i++){
		scanf("%s",s+1);pre1[i].resize(m+1,0);
		for (int j=1;j<=m;j++) pre1[i][j]=(pre1[i][j-1]*bas+s[j])%mod;
	}
	for (int i=1;i<=n;i++){
		scanf("%s",s+1);pre2[i].resize(m+1,0);
		for (int j=1;j<=m;j++) pre2[i][j]=(pre2[i][j-1]*bas+s[j])%mod;
	}
	for (int i=0;i<m;i++){
		mp.clear();Index=0;
		for (int j=1;j<=n;j++)
			g[idx(pre1[j][i])].push_back({idx((pre1[j][m]+mod-pre1[j][i]*pw[m-i]%mod+delta)%mod),j}),
			g[idx((pre2[j][m-i]+delta)%mod)].push_back({idx((pre2[j][m]+mod-pre2[j][m-i]*pw[i]%mod)%mod),j+n});
		if (check()){ans1.clear();ans2.clear();
			for (auto x:ans)
				if (x<=n) ans1.push_back(x);
				else ans2.push_back(x-n);
			for (auto x:ans1) printf("%d ",x);puts("");
			for (auto x:ans2) printf("%d ",x);puts("");
			for (int j=1;j<=Index;j++) g[j].clear(); return ;
		}
		for (int j=1;j<=Index;j++) g[j].clear();
	}  puts("-1");
}
int main(){
	scanf("%d",&T);
	while (T--) solve();
	return 0;
}