#pragma GCC optimize("2,3,Ofast,inline,unroll-loops")
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
inline ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-f;ch=getchar();}
	while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	return x*f;
}
inline void write(ll x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
const ll N=4e6+9,B=4398523,Mod=248572467;
int T,n,m,hd[N],tote,tot,in[N],out[N],cur[N];
ll pw[N];
vector<ll>hsha[N],hshb[N];
vector<char>a[N],b[N];
map<ll,ll>pt;
ll Ha(ll id,ll l,ll r){
	if(l>r)return 0;
	return (hsha[id][r]-hsha[id][l-1]*pw[r-l+1]%Mod+Mod)%Mod;
}
ll Hb(ll id,ll l,ll r){
	if(l>r)return 0;
	return (hshb[id][r]-hshb[id][l-1]*pw[r-l+1]%Mod+Mod)%Mod;
}
struct Edg{
	int to,nxt,id,tp;
}es[N];
vector<pii>res;
void adde(ll x,ll y,ll z,ll w){
	out[x]++,in[y]++;
	es[++tote]=(Edg){y,hd[x],z,w};
	hd[x]=tote;
}
void dfs(ll x){
	for(int&i=cur[x];i;){
		ll y=es[i].to;
		res.push_back(make_pair(es[i].id,es[i].tp));
		i=es[i].nxt;
		dfs(y);
	}
}
char s[N];
void solve(ll tst){
	n=read(),m=read();
	pw[0]=1;
	rep(i,1,m)pw[i]=pw[i-1]*B%Mod;
	rep(i,1,n)hsha[i].clear(),hsha[i].resize(m+2);
	rep(i,1,n)hshb[i].clear(),hshb[i].resize(m+2);
	rep(i,1,n){
		scanf("%s",s+1);
		a[i].clear(),a[i].resize(m+2);
		rep(j,1,m){
			a[i][j]=s[j];
			hsha[i][j]=(hsha[i][j-1]*B+a[i][j])%Mod;
		}
	}
	rep(i,1,n){
		scanf("%s",s+1);
		b[i].clear(),b[i].resize(m+2);
		rep(j,1,m){
			b[i][j]=s[j];
			hshb[i][j]=(hshb[i][j-1]*B+b[i][j])%Mod;
		}
	}
	vector<ll>resa,resb;
	rep(i,0,m-1){
		tot=0,tote=0;
		pt.clear();
		rep(j,0,n*4)hd[j]=0,in[j]=out[j]=0;
		rep(j,1,n){
			ll pre=Ha(j,1,i),suf=(Ha(j,i+1,m)*2304872%Mod+3248274)%Mod;
			if(pt.find(pre)==pt.end())pt[pre]=++tot;
			if(pt.find(suf)==pt.end())pt[suf]=++tot;
			adde(pt[pre],pt[suf],j,0);
		}
		rep(j,1,n){
			ll pre=(Hb(j,1,m-i)*2304872%Mod+3248274)%Mod,suf=Hb(j,m-i+1,m);
			if(pt.find(pre)==pt.end())pt[pre]=++tot;
			if(pt.find(suf)==pt.end())pt[suf]=++tot;
			adde(pt[pre],pt[suf],j,1);
		}
		ll fl=1;
		rep(j,1,tot){
			if(abs(in[j]-out[j])>=1){
				fl=0;
				break;
			}
		}
		if(!fl)continue;
		rep(j,1,tot)cur[j]=hd[j];
		res.clear();
		dfs(1);
		if((int)res.size()!=2*n)continue;
		for(pii p:res){
			if(!p.second)resa.push_back(p.first);
			else resb.push_back(p.first);
		}
		for(ll x:resa)write(x),putchar(' ');
		putchar('\n');
		for(ll x:resb)write(x),putchar(' ');
		putchar('\n');
		return ;
	}
	puts("-1");
}
bool Med;
int main(){
	cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
	T=read();
	rep(i,1,T)solve(i);
	return 0;
}