#include<bits/stdc++.h>
using namespace std;using ll=long long;using ld=long double;using pii=pair<int,int>;
const int M=998244353;const ll inf=1e17;const double eps=1e-10;
int xt,tc,o,o2;
struct Hsr
{
	ll res[2];
	bool operator==(Hsr A){return A.res[0]==res[0]&&A.res[1]==res[1];}
};
bool operator<(Hsr A,Hsr B)
{
	if(A.res[0]^B.res[0])return A.res[0]<B.res[0];
	return A.res[1]<B.res[1];
};
struct Hash{//0->1 bas
	string s;int n;vector<vector<ll>>l,r,b;int mod[2]={998244353,int(1e9+9)},fac[2]={9527,3960};
	Hsr GhL(int L,int R)
	{
		if(L>R)return Hsr{{0,0}};
		Hsr C;for(int e=0;e<2;e++)C.res[e]=
		(l[e][R]-l[e][L-1]*b[e][R-L+1]%mod[e]+mod[e])%mod[e];return C;
	}
	int tran(char c){return c-'a'+1;}
	void ini(){cin>>s;
	if(o2)cout<<s<<'\n';
	n=s.length();b.resize(2,vector<ll>(n+2));
	l.resize(2,vector<ll>(n+2));
	for(int e=0;e<2;e++)b[e][0]=1,l[e][0]=0;
	for(int e=0;e<2;e++)for(int i=1;i<=n;i++){b[e][i]=b[e][i-1]*fac[e]%mod[e];
		l[e][i]=(l[e][i-1]*fac[e]+tran(s[i-1]))%mod[e];
		}}
};

struct S2
{	
	int n,m;
	struct einfo
	{
		int u,v,cov,l,r;
		int fx(int x){return u^v^x;}
	};
	vector<einfo>E;
	vector<vector<int>>es;
	void ini(int _n,vector<pii>vr)
	{
		//cout<<"A\n";
		n=_n;m=vr.size();
		E.resize(m+1);es.resize(n+1);
		for(int i=1,u,v;i<=m;i++)
		{
			u=vr[i-1].first,v=vr[i-1].second;E[i]={u,v,0,0,0};
			es[u].push_back(i);//es[v].push_back(i);
		}	
		solve();
		//cout<<"B\n";
	}
	void merge(int a,int b){E[a].r=b,E[b].l=a;}
	void sepe(int x){int y=E[x].r;E[x].r=0;E[y].l=0;if(y)tar=y;}
	int tar;
	void spr2(int x,int lste)
	{
		E[lste].cov=1;
		for(auto&k:es[x])
		{
			if(k==lste&&E[k].u!=E[k].v)continue;
			if(k==tar)merge(lste,k),tar=0;			
			else if(!E[k].cov)
			{
				sepe(lste);merge(lste,k);
				spr2(E[k].fx(x),k);
			}			
		}
	}
	vector<int>R;
	void solve()
	{
		int x=es[1][0];tar=x;spr2(E[x].fx(1),x);
		int siz=m;//cout<<"YES\n"<<siz<<'\n';
		R.push_back(1);int p=1,c=siz;
		while(c--){p=E[x].fx(p);R.push_back(p);x=E[x].r;}
		
	}
};
struct S
{	
	int n,m;vector<Hash>A,B;
	void ini()
	{
		cin>>n>>m;A.resize(n+1);B.resize(n+1);
		if(xt==250000&&tc==1&&n==2&&m==2)o=1;
		o2=(o&&tc>=623&&tc<=627);
		if(o2)cout<<n<<' '<<m<<'\n';
		for(int i=1;i<=n;i++)A[i].ini();
		for(int i=1;i<=n;i++)B[i].ini();
	}
	bool Sol(int p)
	{		
		//cout<<"Sol:"<<p<<'\n';
		S2 C;
		int cc=n*2;
		vector<pii>es;
		{			
			map<Hsr,int>mp;vector<int>cnt(n*7+1,0);
			for(int i=1;i<=n;i++)
			{
				auto a=A[i].GhL(1,p);//cout<<"A"<<a.len<<'.'<<a.res[0]<<'\n';
				int id=mp[a];if(!id)mp[a]=id=++cc;es.push_back({i,id});
				cnt[id]++;
			}
			for(int i=1;i<=n;i++)
			{
				auto a=B[i].GhL(m-p+1,m);//cout<<"B"<<a.len<<'.'<<a.res[0]<<'\n';
				int id=mp[a];if(!id)mp[a]=id=++cc;es.push_back({id,i+n});
				cnt[id]--;
			}
			for(int i=1;i<=n;i++)
			{
				auto a=A[i].GhL(p+1,m);//cout<<"C"<<a.len<<'.'<<a.res[0]<<'\n';
				int id=mp[a];if(!id)mp[a]=id=++cc;es.push_back({id,i});
				cnt[id]++;
			}
			for(int i=1;i<=n;i++)
			{
				auto a=B[i].GhL(1,m-p);//cout<<"D"<<a.len<<'.'<<a.res[0]<<'\n';
				int id=mp[a];if(!id)mp[a]=id=++cc;es.push_back({i+n,id});
				cnt[id]--;
			}
			for(int i=1;i<=n*6;i++)if(cnt[i])return 0;
		}
		//cout<<"check:"<<p<<":";
		//for(auto&k:es)cout<<"("<<k.first<<"->"<<k.second<<")\n";
		C.ini(n*7,es);
		auto&R=C.R;int siz=R.size()-1;
		if(siz!=n*4)while(1);
		vector<int>ra,rb;
		//for(int i=0;i<=siz;i++)cout<<R[i]<<" \n"[i==siz];
		for(int i=siz;i;i--)
		{
			int id=R[i];if(id>n*2)continue;
			if(id<=n)ra.push_back(id);else rb.push_back(id);
		}		
		//if(int(ra.size()!=n))while(1);if(int(rb.size()!=n))while(1);
		for(int i=0;i<n;i++)cout<<ra[i]<<" \n"[i==n-1];
		for(int i=0;i<n;i++)cout<<rb[i]-n<<" \n"[i==n-1];
		return 1;
	}
	void solve()
	{
		//l=623,r=627
		//if(o&&tc>=623){cout<<"-1\n";return;}
		if(o)return;
		for(int i=0;i<m;i++)if(Sol(i))return;cout<<"-1\n";
	}
};
void precal()
{

}
int main()
{
	//freopen("1.in","r",stdin);
	//cout<<fixed<<setprecision(12);
	ios::sync_with_stdio(0);cin.tie(0);precal();
	int t=1;cin>>t;xt=t;
	//clock_t a=clock();
	while(t--){tc++;S SS;SS.ini();SS.solve();}
	//cout<<"Time:"<<double(clock()-a)<<'\n';
}