// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T &x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T &x, T y) {x = min(x, y);}
const int N = 1e6 + 10;
const ll MOD = (ll) 998244353 * 1019260817, base = 19491001;
int n, m;
string a[N], b[N];
ll pw[N];
vector <ll> prea[N], sufa[N], preb[N], sufb[N];
void calcpre(string &st, vector <ll> &x) {
	x.resize(m + 1);
	F(i, 1, m) x[i] = (x[i - 1] + (__int128) pw[i] * st[i]) % MOD;
}
void calcsuf(string &st, vector <ll> &x) {
	x.resize(m + 2);
	x[m + 1] = 0;
	DF(i, m, 1) x[i] = (__int128) (x[i + 1] + st[i]) * base % MOD;
}
int tot, fa[N], deg[N];
unordered_map <ll, int> mp;
int d[N];
vector <pair <int, int>> v[N];
int query(ll x) {
	// debug << x << endl;
	if (mp.count(x)) return mp[x];
	tot++;
	d[tot] = 0;
	deg[tot] = 0;
	fa[tot] = tot;
	v[tot].clear();
	return mp[x] = tot;
}
int find(int x) {return x == fa[x] ? x : fa[x] = find(fa[x]);}
vector <int> stk;
void link(int x, int y, int id) {
	// debug << x << " " << y << " " << id << endl;
	fa[find(x)] = find(y);
	deg[x]++, deg[y]--;
	v[x].emplace_back(y, id);
}
void dfs(int x) {
	while (d[x] < v[x].size()) {
		int w = v[x][d[x]].second;
		dfs(v[x][d[x]++].first);
		stk.push_back(w);
	}
}
void zhk() {
	cin >> n >> m;
	pw[0] = 1;
	F(i, 1, m) pw[i] = (__int128) pw[i - 1] * base % MOD;
	F(i, 1, n) {
		string x; cin >> x;
		x = ' ' + x;
		calcpre(x, prea[i]);
		calcsuf(x, sufa[i]);
	}
	F(i, 1, n) {
		string x; cin >> x;
		x = ' ' + x;
		calcpre(x, preb[i]);
		calcsuf(x, sufb[i]);
	}
	// debug << sufa[1][2] << endl;
	// debug << preb[1][2] << endl;
	// exit(0);
	// debug << "OK " << n << " " << m << endl;
	F(i, 0, m - 1) {
		// debug << i << endl;
		tot = 0; mp.clear();
		F(j, 1, n) link(query(prea[j][i]), query(sufa[j][i + 1] + MOD), j);
		F(j, 1, n) link(query(preb[j][m - i] + MOD), query(sufb[j][m - i + 1]), j + n);
		bool flag = true;
		F(j, 1, tot)
			if (deg[j] || find(j) != find(1)) {
				flag = false;
				break;
			}
		if (flag) {
			stk.clear();
			dfs(1);
			reverse(all(stk));
			vector <int> A, B;
			for (int i: stk)
				if (i <= n) A.push_back(i);
				else B.push_back(i - n);
			for (int i: A) cout << i << ' '; cout << '\n';
			for (int i: B) cout << i << ' '; cout << '\n';
			return;
		}
	}
	cout << "-1\n";
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int _ = 1;
	cin >> _;
	while (_--) zhk();
	return 0;
}
/* why?
*/