#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define ti3 tuple<int,int,int>
#define int128 __int128_t
#define pii128 pair<int128,int128>
const int inf = 1 << 30;
const ll linf = 1e18;
const ll mod = 1e9 + 7;
const db EPS = 1e-10;
const db pi = acos(-1);
template<class T> bool chmin(T& x, T y){
    if(x > y) {
        x = y;
        return true;
    } else return false;
}
template<class T> bool chmax(T& x, T y){
    if(x < y) {
        x = y;
        return true;
    } else return false;
}

// overload macro
#define CAT( A, B ) A ## B
#define SELECT( NAME, NUM ) CAT( NAME, NUM )

#define GET_COUNT( _1, _2, _3, _4, _5, _6 /* ad nauseam */, COUNT, ... ) COUNT
#define VA_SIZE( ... ) GET_COUNT( __VA_ARGS__, 6, 5, 4, 3, 2, 1 )

#define VA_SELECT( NAME, ... ) SELECT( NAME, VA_SIZE(__VA_ARGS__) )(__VA_ARGS__)

// rep(overload)
#define rep( ... ) VA_SELECT(rep, __VA_ARGS__)
#define rep2(i, n) for (int i = 0; i < int(n); i++)
#define rep3(i, a, b) for (int i = a; i < int(b); i++)
#define rep4(i, a, b, c) for (int i = a; i < int(b); i += c)

// repll(overload)
#define repll( ... ) VA_SELECT(repll, __VA_ARGS__)
#define repll2(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repll3(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define repll4(i, a, b, c) for (ll i = a; i < (ll)(b); i += c)

// rrep(overload)
#define rrep( ... ) VA_SELECT(rrep, __VA_ARGS__)    
#define rrep2(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep3(i, a, b) for (int i = b - 1; i >= a; i--)
#define rrep4(i, a, b, c) for (int i = b - 1; i >= a; i -= c)

// rrepll(overload)
#define rrepll( ... ) VA_SELECT(rrepll, __VA_ARGS__)
#define rrepll2(i, n) for (ll i = (ll)(n) - 1; i >= 0ll; i--)
#define rrepll3(i, a, b) for (ll i = b - 1; i >= (ll)(a); i--)
#define rrepll4(i, a, b, c) for (ll i = b - 1; i >= (ll)(a); i -= c)

// for_earh
#define fore(e, v) for (auto&& e : v)

// vector
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

random_device rnd;
mt19937 mt(rnd());

struct rolling_hash {
private:
    static inline const ll base = mt() + 2;
    static const ll MASK30 = (1ll << 30) - 1;
    static const ll MASK31 = (1ll << 31) - 1;
    static const ll HASH_MOD = (1ll << 61) - 1;
    static const ll MASK61 = HASH_MOD;

    ll calc_mod(ll x) {
        ll xu = x >> 61;
        ll xl = x & MASK61;
        ll ret = xu + xl;
        if (ret >= HASH_MOD) ret -= HASH_MOD;
        return ret;
    }

    ll calc_mul(ll a, ll b) {
        ll au = a >> 31;
        ll al = a & MASK31;
        ll bu = b >> 31;
        ll bl = b & MASK31;
        ll mid = al * bu + au * bl;
        ll midu = mid >> 30;
        ll midl = mid & MASK30;
        return calc_mod(au * bu * 2 + midu + (midl << 31) + al * bl);
    }
public:
    int N;
    string S;
    vector<ll> hash, power;
    rolling_hash(){}
    rolling_hash(string s) : N(s.size()), S(s), hash(N + 1), power(N + 1) {
        power[0] = 1, hash[0] = S[0];
        for (int i = 0; i < N; i++) {
            power[i + 1] = calc_mul(power[i], base);
            hash[i + 1] = calc_mod(calc_mul(hash[i], base) + s[i]);
        }
    }

    ll get_hash(int l = 0, int r = -1) {
        if (r == -1) r = N;
        return calc_mod(hash[r] - calc_mul(hash[l], power[r - l]) + HASH_MOD); 
    }
};

void solve() {
    int n, m;
    cin >> n >> m;
    vector<string> A(n), B(n);
    vector<rolling_hash> arh(n), brh(n);
    rep (i, n) cin >> A[i], arh[i] = rolling_hash(A[i]);
    rep (i, n) cin >> B[i], brh[i] = rolling_hash(B[i]);

    bool flag = false;
    vector<int> pa(n), pb(n);
    auto judge = [&](int sh) {
        map<pair<ll, int>, int> vs;
        vector<vector<pii>> G(4 * n);
        vector<int> deg(4 * n);

        // 各hash値に番号を割り当てる
        auto make_node = [&](vector<rolling_hash>& rh, int sh, int& idx, int st) {
            rep (i, rh.size()) {
                ll preh = rh[i].get_hash(0, sh);
                ll posh = rh[i].get_hash(sh);
                if (vs.find({preh, st}) == vs.end()) vs[{preh, st}] = idx++;
                if (vs.find({posh, st ^ 1}) == vs.end()) vs[{posh, st ^ 1}] = idx++;
            }
        };

        int idx = 0;
        make_node(arh, sh, idx, 0);
        make_node(brh, m - sh, idx, 1);

        // 辺をはる
        auto make_edge = [&](vector<rolling_hash>& rh, int sh, int st) {
            rep (i, rh.size()) {
                ll preh = rh[i].get_hash(0, sh);
                ll posh = rh[i].get_hash(sh);
                G[vs[{preh, st}]].emplace_back(vs[{posh, st ^ 1}], i);
                deg[vs[{preh, st}]]++, deg[vs[{posh, st ^ 1}]]--;
            }
        };

        make_edge(arh, sh, 0);
        make_edge(brh, m - sh, 1);

        bool ok = true;
        rep (i, idx) ok &= deg[i] == 0;
        if (!ok) return;

        rep (i, idx) {
            fore (u, G[i]) {
                auto [to, num] = u;
            }
        }

        vector<int> path;
        auto dfs = [&](auto&& self, int u) -> void {
            while (!G[u].empty()) {
                auto [v, num] = G[u].back();
                G[u].pop_back();
                self(self, v);
                path.push_back(num);
            }
        };

        dfs(dfs, 0);

        int st = 0;
        reverse(all(path));
        vector<vector<int>> ans(2);
        fore (u, path) {
            ans[st].push_back(u);
            st ^= 1;
        }

        if (ans[0].size() == ans[1].size() && (int)ans[0].size() == n) pa = ans[0], pb = ans[1], flag = true;
    };

    rep (i, m) {
        judge(i);
    }

    if (flag) {
        fore (u, pa) cout << u + 1 << ' ';
        cout << '\n';
        fore (u, pb) cout << u + 1 << ' ';
        cout << '\n';
    } else {
        cout << -1 << '\n';
    }
}

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    int t;
    cin >> t;
    while (t--) solve();
    return 0;
}