#include<vector>
#include<stack>
#include<iostream>
#include<map>

using namespace std;
#define endl "\n"
#define ll long long
const int N = 4e6 + 10;
int n, m;

vector<int > ed[N];
stack<int > st;

vector<int > ansa;
vector<int > ansb;
int in[N];
int out[N];
int cnt;
map<pair<int, int>, vector<int > > mpa;
map<pair<int, int>, vector<int > > mpb;
string sa[N];
string sb[N];
map<string, int> mp;
map<int, string> fmp;
int mode;
bool sta[N];
void dfs(int u)
{
	sta[u] = 1;
	while (!ed[u].empty())
	{
		int tmp = ed[u].back();
		ed[u].pop_back();
		dfs(tmp);
	}
	if (st.size() != 0) {
		if (st.size() & 1)
		{
			if (mpb[{u, st.top()}].size() == 0)
				mode = 1;
		}
		else {
				if (mpa[{u, st.top()}].size() == 0) 
					mode = 1;
			}
	}
	st.push(u);
}
void solve()
{

	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		cin >> sa[i];
	for (int i = 1; i <= n; i++)
		cin >> sb[i];
	for (int i = 0; i < m; i++)
	{
		mp.clear();
		fmp.clear();
		for (int j = 1; j <= cnt; j++) ed[j].clear(), in[j] = out[j] = 0;
		mpa.clear();
		mpb.clear();
		ansa.clear();
		ansb.clear();
		cnt = 1;
		for (int j = 1; j <= n; j++)
		{
			string tmpa = sa[j].substr(0, i), tmpb = sa[j].substr(i);
			if (mp[tmpa] == 0) mp[tmpa] = cnt++, fmp[cnt - 1] = tmpa;
			if (mp[tmpb] == 0) mp[tmpb] = cnt++, fmp[cnt - 1] = tmpb;
			out[mp[tmpa]]++;
			in[mp[tmpb]]++;
			mpa[{mp[tmpa], mp[tmpb]}].push_back(j);
			ed[mp[tmpa]].push_back(mp[tmpb]);
		}
		for (int j = 1; j <= n; j++)
		{
			string tmpa = sb[j].substr(0, m - i), tmpb;
			if (i != 0) tmpb = sb[j].substr(m - i, i);
			else tmpb = "";
			if (mp[tmpa] == 0) mp[tmpa] = cnt++, fmp[cnt - 1] = tmpa;
			if (mp[tmpb] == 0) mp[tmpb] = cnt++, fmp[cnt - 1] = tmpb;
			out[mp[tmpa]]++;
			in[mp[tmpb]]++;
			mpb[{mp[tmpa], mp[tmpb]}].push_back(j);
			ed[mp[tmpa]].push_back(mp[tmpb]);
		}
		bool flag = 0;
		for (int j = 1; j < cnt; j++)
			if (in[j] != out[j]) {
				flag = 1; break;
			}
		if (flag) continue;
		for (int i = 0; i <= cnt; i++) sta[i] = 0;
		for (int i = 1; i < cnt; i++) {
			if (sta[i]) continue;
			mode = 0;
			dfs(i);
			int pre = st.top();
			st.pop();
			int cc = 0;
			while (!st.empty()) {
				int now = st.top();
				st.pop();
				if (mode == 0)
				{
					if (cc & 1) {
						ansb.push_back(mpb[{pre, now}].back());
						mpb[{pre, now}].pop_back();
					}
					else {
						ansa.push_back(mpa[{pre, now}].back());
						mpa[{pre, now}].pop_back();
					}
					
				}
				else
				{
					if (cc & 1) {
						ansa.push_back(mpa[{pre, now}].back());
						mpa[{pre, now}].pop_back();
					}
					else {
						ansb.push_back(mpb[{pre, now}].back());
						mpb[{pre, now}].pop_back();
					}
				}
				pre = now;
				cc++;
			}
		}

		if (ansa.size() != n || ansb.size() != n) return cout << -1 << endl, void();
		for (int j : ansa) cout << j << " ";
		cout << endl;
		for (int j : ansb) cout << j << " ";
		cout << endl;
		return;
	}

	cout << -1 << endl;

}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin >> t;
	while (t--)
		solve();
}