/*
 * @Author:             cmk666
 * @Created time:       2023-11-04 13:47:26
 * @Last Modified time: 2023-11-04 15:08:06
 */
#pragma GCC optimize("Ofast", "unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include"debug.h"
#else
#define D(...) ((void)0)
#endif
using namespace std; using ll = long long;
#define For(i, j, k) for ( int i = (j) ; i <= (k) ; i++ )
#define Fol(i, j, k) for ( int i = (j) ; i >= (k) ; i-- )
namespace FastIO
{
// ------------------------------
// #define IN_HAS_NEG
// #define OUT_HAS_NEG
// #define CHK_EOF
// #define DISABLE_MMAP
// ------------------------------
#if __cplusplus < 201400
#error Please use C++14 or higher.
#endif
#if __cplusplus > 201700
#define INLINE_V inline
#else
#define INLINE_V
#endif
#if ( defined(LOCAL) || defined(_WIN32) ) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifndef DISABLE_MMAP
#include<sys/mman.h>
#endif
#ifdef LOCAL
	inline char gc() { return getchar(); }
	inline void pc(char c) { putchar(c); }
#else
#ifdef DISABLE_MMAP
	INLINE_V constexpr int _READ_SIZE = 1 << 18;
	INLINE_V static char _read_buffer[_READ_SIZE], *_read_ptr = nullptr, *_read_ptr_end = nullptr;
	inline char gc()
	{
		if ( __builtin_expect(_read_ptr == _read_ptr_end, false) )
		{
			_read_ptr = _read_buffer;
			_read_ptr_end = _read_buffer + fread(_read_buffer, 1, _READ_SIZE, stdin);
#ifdef CHK_EOF
			if ( __builtin_expect(_read_ptr == _read_ptr_end, false) ) return EOF;
#endif
		}
		return *_read_ptr++;
	}
#else
	INLINE_V static const char *_read_ptr = (const char *)mmap(nullptr, INT_MAX, 1, 2, 0, 0);
	inline char gc() { return *_read_ptr++; }
#endif
	INLINE_V constexpr int _WRITE_SIZE = 1 << 18;
	INLINE_V static char _write_buffer[_WRITE_SIZE], *_write_ptr = _write_buffer;
	inline void pc(char c)
	{
		*_write_ptr++ = c;
		if ( __builtin_expect(_write_buffer + _WRITE_SIZE == _write_ptr, false) )
		{
			fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
			_write_ptr = _write_buffer;
		}
	}
	INLINE_V struct _auto_flush
	{
		inline ~_auto_flush() { fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout); }
	}	_auto_flush;
#endif
#ifdef CHK_EOF
	inline constexpr bool _isdigit(char c) { return ( c & 16 ) && c != EOF; }
	inline constexpr bool _isgraph(char c) { return c > 32 && c != EOF; }
#else
	inline constexpr bool _isdigit(char c) { return c & 16; }
	inline constexpr bool _isgraph(char c) { return c > 32; }
#endif
	template < class T >
	INLINE_V constexpr bool _is_integer = numeric_limits < T >::is_integer;
	template < class T >
	INLINE_V constexpr bool _is_signed = numeric_limits < T >::is_signed;
	template < class T >
	INLINE_V constexpr bool _is_unsigned = _is_integer < T > && !_is_signed < T >;
	template <> INLINE_V constexpr bool _is_integer < __int128 > = true;
	template <> INLINE_V constexpr bool _is_integer < __uint128_t > = true;
	template <> INLINE_V constexpr bool _is_signed < __int128 > = true;
	template <> INLINE_V constexpr bool _is_unsigned < __uint128_t > = true;
#undef INLINE_V
	inline void read(char &c) { do c = gc(); while ( !_isgraph(c) ); }
	inline void read_cstr(char *s)
	{
		char c = gc(); while ( !_isgraph(c) ) c = gc();
		while ( _isgraph(c) ) *s++ = c, c = gc();
		*s = 0;
	}
	inline void read(string &s)
	{
		char c = gc(); s.clear(); while ( !_isgraph(c) ) c = gc();
		while ( _isgraph(c) ) s.push_back(c), c = gc();
	}
#ifdef IN_HAS_NEG
	template < class T, enable_if_t < _is_signed < T >, int > = 0 >
	inline void read(T &x)
	{
		char c = gc(); bool f = true; x = 0;
		while ( !_isdigit(c) ) { if ( c == 45 ) f = false; c = gc(); }
		if ( f ) while ( _isdigit(c) ) x = x * 10 + ( c & 15 ), c = gc();
		else     while ( _isdigit(c) ) x = x * 10 - ( c & 15 ), c = gc();
	}
	template < class T, enable_if_t < _is_unsigned < T >, int > = 0 >
#else
	template < class T, enable_if_t < _is_integer < T >, int > = 0 >
#endif
	inline void read(T &x)
	{
		char c = gc(); while ( !_isdigit(c) ) c = gc();
		x = 0; while ( _isdigit(c) ) x = x * 10 + ( c & 15 ), c = gc();
	}
	inline void write(char c) { pc(c); }
	inline void write_cstr(const char *s) { while ( *s ) pc(*s++); }
	inline void write(const string &s) { for ( char c : s ) pc(c); }
#ifdef OUT_HAS_NEG
	template < class T, enable_if_t < _is_signed < T >, int > = 0 >
	inline void write(T x)
	{
		char buffer[numeric_limits < T >::digits10 + 1]; int digits = 0;
		if ( x >= 0 )  do buffer[digits++] =  ( x % 10 ) | 48, x /= 10; while ( x );
		else { pc(45); do buffer[digits++] = -( x % 10 ) | 48, x /= 10; while ( x ); }
		while ( digits ) pc(buffer[--digits]);
	}
	template < class T, enable_if_t < _is_unsigned < T >, int > = 0 >
#else
	template < class T, enable_if_t < _is_integer < T >, int > = 0 >
#endif
	inline void write(T x)
	{
		char buffer[numeric_limits < T >::digits10 + 1]; int digits = 0;
		do buffer[digits++] = ( x % 10 ) | 48, x /= 10; while ( x );
		while ( digits ) pc(buffer[--digits]);
	}
	template < int N > struct _tuple_io_helper
	{
		template < class ...T >
		static inline void _read(tuple < T... > &x)
		{ _tuple_io_helper < N - 1 >::_read(x), read(get < N - 1 > (x)); }
		template < class ...T >
		static inline void _write(const tuple < T... > &x)
		{ _tuple_io_helper < N - 1 >::_write(x), pc(32), write(get < N - 1 > (x)); }
	};
	template <> struct _tuple_io_helper < 1 >
	{
		template < class ...T >
		static inline void _read(tuple < T... > &x) { read(get < 0 > (x)); }
		template < class ...T >
		static inline void _write(const tuple < T... > &x) { write(get < 0 > (x)); }
	};
	template < class ...T >
	inline void read(tuple < T... > &x) { _tuple_io_helper < sizeof...(T) >::_read(x); }
	template < class ...T >
	inline void write(const tuple < T... > &x) { _tuple_io_helper < sizeof...(T) >::_write(x); }
	template < class T1, class T2 >
	inline void read(pair < T1, T2 > &x) { read(x.first), read(x.second); }
	template < class T1, class T2 >
	inline void write(const pair < T1, T2 > &x) { write(x.first), pc(32), write(x.second); }
	template < class T1, class ...T2 >
	inline void read(T1 &x, T2 &...y) { read(x), read(y...); }
	template < class ...T >
	inline void read_cstr(char *x, T *...y) { read_cstr(x), read_cstr(y...); }
	template < class T1, class ...T2 >
	inline void write(const T1 &x, const T2 &...y) { write(x), write(y...); }
	template < class ...T >
	inline void write_cstr(const char *x, const T *...y) { write_cstr(x), write_cstr(y...); }
	template < class T >
	inline void print(const T &x) { write(x); }
	inline void print_cstr(const char *x) { write_cstr(x); }
	template < class T1, class ...T2 >
	inline void print(const T1 &x, const T2 &...y) { print(x), pc(32), print(y...); }
	template < class ...T >
	inline void print_cstr(const char *x, const T *...y) { print_cstr(x), pc(32), print_cstr(y...); }
	inline void println() { pc(10); }
	inline void println_cstr() { pc(10); }
	template < class ...T >
	inline void println(const T &...x) { print(x...), pc(10); }
	template < class ...T >
	inline void println_cstr(const T *...x) { print_cstr(x...), pc(10); }
}
using namespace FastIO;
constexpr ll B = 233, P = 1145141919810000037;
ll pw[1000009];
inline ll mul(ll x, ll y, ll p)
{
	ll z = x * y - (ll)( 1.l * x * y / p ) * p;
	z >= p && ( z -= p ), z < 0 && ( z += p );
	return z;
}
inline void init(int x) { *pw = 1; For(i, 1, x) pw[i] = mul(pw[i - 1], B, P); }
inline void calc_hash(auto &h, int n, char *s)
{
	h.resize(n + 1), h[0] = 0;
	For(i, 1, n) { h[i] = mul(h[i - 1], B, P) + s[i] - 'a' + 1; if ( h[i] >= P ) h[i] -= P; }
}
inline ll qry(const auto &h, int l, int r)
{
	ll z = h[r] - mul(h[l - 1], pw[r - l + 1], P);
	return z >= 0 ? z : z + P;
}
char s[1000009]; bool ok; vector < ll > hs[1000009], ht[1000009];
vector < int > res, g[2][4000009]; ll num[4000009];
int n, m, ids[1000009], idt[1000009], ls, lt, len, degi[2][4000009], dego[2][4000009];
struct hasher { inline int operator()(const auto &x)const { return x.first ^ x.second; } };
unordered_map < pair < int, int >, vector < int >, hasher > e[2];
inline void dfs(int u, int f)
{
	for ( int v ; g[f][u].size() ; ) v = g[f][u].back(), g[f][u].pop_back(), dfs(v, !f);
	res.push_back(u);
}
inline void work()
{
	read(n, m), init(m);
	For(i, 1, n) read_cstr(s + 1), calc_hash(hs[i], m, s);
	For(i, 1, n) read_cstr(s + 1), calc_hash(ht[i], m, s);
	iota(ids + 1, ids + n + 1, 1), iota(idt + 1, idt + n + 1, 1),
	sort(ids + 1, ids + n + 1, [&](int x, int y) { return hs[x][m] < hs[y][m]; }),
	sort(idt + 1, idt + n + 1, [&](int x, int y) { return ht[x][m] < ht[y][m]; });
	ok = true;
	For(i, 1, n) if ( hs[ids[i]][m] != ht[idt[i]][m] ) { ok = false; break; }
	if ( ok )
	{
		For(i, 1, n) write(ids[i], i == n ? '\n' : ' ');
		For(i, 1, n) write(idt[i], i == n ? '\n' : ' ');
		return;
	}
	For(l, 1, m - 1)
	{
		len = 0;
		For(i, 1, n) num[++len] = qry(hs[i], 1, l), num[++len] = qry(hs[i], l + 1, m);
		For(i, 1, n) num[++len] = qry(ht[i], 1, m - l), num[++len] = qry(ht[i], m - l + 1, m);
		sort(num + 1, num + len + 1), len = unique(num + 1, num + len + 1) - num - 1;
		const auto id = [&](ll x) -> int { return lower_bound(num + 1, num + len + 1, x) - num; };
		For(i, 1, len) g[0][i].clear(), g[1][i].clear(), degi[0][i] = degi[1][i] = dego[0][i] = dego[1][i] = 0;
		e[0].clear(), e[1].clear();
		const auto addedge = [&](int u, int v, int w, int f) {
			g[f][u].push_back(v), e[f][pair(u, v)].push_back(w), dego[f][u]++, degi[f][v]++;
		};
		For(i, 1, n) addedge(id(qry(hs[i], 1, l)), id(qry(hs[i], l + 1, m)), i, 0);
		For(i, 1, n) addedge(id(qry(ht[i], 1, m - l)), id(qry(ht[i], m - l + 1, m)), i, 1);
		ok = true;
		For(i, 1, len) if ( degi[0][i] != dego[1][i] || degi[1][i] != dego[0][i] ) { ok = false; break; }
		if ( !ok ) continue;
		res.clear(), dfs(id(qry(hs[1], 1, l)), 0);
		if ( (int)res.size() != n + n + 1 ) continue;
		ls = lt = 0;
		Fol(i, n + n, 1)
		{
			auto p = pair(res[i], res[i - 1]);
			if ( i & 1 ) assert(e[1][p].size()), idt[++lt] = e[1][p].back(), e[1][p].pop_back();
			else         assert(e[0][p].size()), ids[++ls] = e[0][p].back(), e[0][p].pop_back();
		}
		For(i, 1, n) write(ids[i], i == n ? '\n' : ' ');
		For(i, 1, n) write(idt[i], i == n ? '\n' : ' ');
		return;
	}
	println("-1"s);
}
int main() { int t; read(t); For(tt, 1, t) work(); return 0; }
// 想上GM捏 想上GM捏 想上GM捏 想上GM捏 想上GM捏
// 伊娜可爱捏 伊娜贴贴捏