#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=1000010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

const int B[2] = {31337, 37};

int tt, n, m;
ll pot[2][N], deg[N * 5];
vector <string> s[2];
vector <vector<int>> h_pref[2][2], h_suf[2][2];
vector <pii> v[N * 5];
unordered_map <ll, int> mp;
vector <int> sol, sola, solb;

void calc_hash () {
	for (int br = 0; br < 2; br++) {
		pot[br][0] = 1;
		for (int j = 1; j <= m; j++) {
			pot[br][j] = ((ll) pot[br][j - 1] * B[br]) % MOD;
		}
	}
	for (int koji = 0; koji < 2; koji++) {
		for (int br = 0; br < 2; br++) {
			h_pref[koji][br].resize(n + 1, vector<int>(m));
			for (int i = 1; i <= n; i++) {
				ll h = 0;
				for (int j = 0; j < m; j++) {
					h = (h * B[br] + s[koji][i][j]) % MOD;
					h_pref[koji][br][i][j] = h;
				}
			}
			h_suf[koji][br].resize(n + 1, vector<int>(m));
			for (int i = 1; i <= n; i++) {
				ll h = 0;
				for (int j = m - 1; j >= 0; j--) {
					h = (pot[br][m - 1 - j] * s[koji][i][j] + h) % MOD;
					h_suf[koji][br][i][j] = h;
				}
			}
		}
	}
}

bool build_graph (int k) {
	int cnt = 4 * n + 3;
	mp.clear();
	for (int i = 1; i <= cnt * 2; i++) {
		v[i].clear();
		deg[i] = 0;
	}
	for (int koji = 0; koji < 2; koji++) {
		for (int i = 1; i <= n; i++) {
			int node_pref = i * 4 + koji * 2 + 0;
			int node_suf  = i * 4 + koji * 2 + 1;
			int edge = i * 2 + koji;
			v[node_pref].push_back({node_suf, edge});
			
			ll h, node;
			
			h = (((ll) h_pref[koji][0][i][k - 1]) << 31) + h_pref[koji][1][i][k - 1];
			if (mp.find(h) == mp.end()) {
				cnt++;
				mp[h] = cnt;
			}
			node = mp[h];
			v[node].push_back({node_pref, 0});
			deg[node]++;
			
			h = (((ll) h_suf[koji][0][i][k]) << 31) + h_suf[koji][1][i][k];
			if (mp.find(h) == mp.end()) {
				cnt++;
				mp[h] = cnt;
			}
			node = mp[h];
			v[node_suf].push_back({node, 0});
			deg[node]--;
		}
		k = m - k;
	}
	for (int i = 1; i <= cnt * 2; i++) {
		if (deg[i] != 0) return 0;
	}
	return 1;
}

void euler (int node) {
	while (!v[node].empty()) {
		int sus = v[node].back().first;
		int edge = v[node].back().second;
		v[node].pop_back();
		euler(sus);
		sol.push_back(edge);
	}
}

bool moze_euler () {
	sol.clear();
	euler(4);
	return ((int)sol.size() == 6 * n);
}

void ispis_sol () {
	reverse(sol.begin(), sol.end());
	sola.clear(); solb.clear();
	for (auto e : sol) {
		if (e == 0) continue;
		if (e % 2 == 0) sola.push_back(e / 2);
		if (e % 2 == 1) solb.push_back(e / 2);
	}
	for (auto i : sola) cout << i << " "; 
	cout << '\n';
	for (auto i : solb) cout << i << " "; 
	cout << '\n';
}

bool check_trivial () {
	vector <pair<string, int>> S[2];
	S[0].resize(n);
	S[1].resize(n);
	for (int koji = 0; koji < 2; koji++) {
		for (int i = 1; i <= n; i++) {
			S[koji][i - 1] = {s[koji][i], i};
		}
		sort(S[koji].begin(), S[koji].end());
	}
	for (int i = 0; i < n; i++) {
		if (S[0][i].first != S[1][i].first) return 0;
	}
	for (int koji = 0; koji < 2; koji++) {
		for (int i = 0; i < n; i++) {
			cout << S[koji][i].second << " ";
		}
		cout << '\n';
	}
	return 1;
}

int main () {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> tt;
	for (int ii = 0; ii < tt; ii++) {
		cin >> n >> m;
		s[0].resize(n + 1);
		s[1].resize(n + 1);
		for (int koji = 0; koji < 2; koji++) {
			for (int i = 1; i <= n; i++) {
				cin >> s[koji][i];
			}
		}
		calc_hash();
		bool naso = 0;
		for (int k = 1; k < m; k++) {
			if (build_graph(k) && moze_euler()) {
				naso = 1;
				ispis_sol();
				break;
			}
		}
		if (!naso) {
			if (check_trivial()) {
				naso = 1;
			}
		}
		if (!naso) {
			cout << "-1\n";
		}
	}
	return 0;
}