#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = (ll)mod17 * mod17;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
    a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
    a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
    vector<T> res;
    int ida = 0, idb = 0;
    while (ida < a.size() || idb < b.size()) {
        if (idb == b.size()) {
            res.push_back(a[ida]); ida++;
        }
        else if (ida == a.size()) {
            res.push_back(b[idb]); idb++;
        }
        else {
            if (a[ida] < b[idb]) {
                res.push_back(a[ida]); ida++;
            }
            else {
                res.push_back(b[idb]); idb++;
            }
        }
    }
    return res;
}
template<typename T>
void cinarray(vector<T>& v) {
    rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
    rep(i, v.size()) {
        if (i > 0)cout << " "; cout << v[i];
    }
    cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
    if (n < 0) {
        ll res = mod_pow(x, -n, m);
        return mod_pow(res, m - 2, m);
    }
    if (abs(x) >= m)x %= m;
    if (x < 0)x += m;
    //if (x == 0)return 0;
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
//mod should be <2^31
struct modint {
    int n;
    modint() :n(0) { ; }
    modint(ll m) {
        if (m < 0 || mod <= m) {
            m %= mod; if (m < 0)m += mod;
        }
        n = m;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
    a = abs(a); b = abs(b);
    if (a < b)swap(a, b);
    while (b) {
        ll r = a % b; a = b; b = r;
    }
    return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
    if (loc >= v.size())v.resize(loc + 1, 0);
    v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
    fill(isp + 2, isp + mn, true);
    for (int i = 2; i < mn; i++) {
        if (!isp[i])continue;
        ps.push_back(i);
        for (int j = 2 * i; j < mn; j += i) {
            isp[j] = false;
        }
    }
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    if (res == st.begin())return st.end();
    res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
    return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
    a = a + b; return a;
}
mP operator-(mP a, mP b) {
    return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
    a = a - b; return a;
}
LP operator+(LP a, LP b) {
    return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
    a = a + b; return a;
}
LP operator-(LP a, LP b) {
    return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
    a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//------------------------------------

struct uf {
private:
    vector<int> par, ran;
public:
    uf(int n) {
        par.resize(n, 0);
        ran.resize(n, 0);
        rep(i, n) {
            par[i] = i;
        }
    }
    int find(int x) {
        if (par[x] == x)return x;
        else return par[x] = find(par[x]);
    }
    void unite(int x, int y) {
        x = find(x), y = find(y);
        if (x == y)return;
        if (ran[x] < ran[y]) {
            par[x] = y;
        }
        else {
            par[y] = x;
            if (ran[x] == ran[y])ran[x]++;
        }
    }
    bool same(int x, int y) {
        return find(x) == find(y);
    }
};

bool isp(int x) {
    if (x == 1)return false;
    for (int i = 2; i * i <= x; i++) {
        if (x % i == 0)return false;
    }
    return true;
}
//1.1*10^9だと2.2*10^9がintでoverflowする
mt19937 mtle(time(0));
uniform_int_distribution<> udle(900000000, 1000000000);
int findmodp() {
    int le = udle(mtle);
    while (!isp(le))le++;
    return le;
}
using ar = array<ll, 2>;

ar ms;
ar ts;

ar rhs[1000005];
void init() {
    rep(i, 2) {
        ms[i] = findmodp();
        ts[i] = findmodp();
        while (ts[i] % ms[i] == 0) {
            ts[i] = findmodp();
        }
        ts[i] %= ms[i];
    }
    rhs[0] = { 1,1 };
    rep(i, 1000004) {
        rep(j, 2) {
            rhs[i + 1][j] = rhs[i][j] * ts[j] % ms[j];
        }
    }
}

ar operator*(ar a, ll v) {
    rep(j, 2) {
        ll adv = v % ms[j];
        if (adv < 0)adv += ms[j];
        a[j] *= adv; a[j] %= ms[j];
    }
    return a;
}
ar operator*(ar a, ar b) {
    rep(j, 2) {
        a[j] *= b[j];
        a[j] %= ms[j];
    }
    return a;
}
ar operator+(ar a, ar b) {
    rep(j, 2) {
        a[j] += b[j]; if (a[j] >= ms[j])a[j] -= ms[j];
    }
    return a;
}
ar operator-(ar a, ar b) {
    rep(j, 2) {
        a[j] -= b[j]; if (a[j] < 0)a[j] += ms[j];
    }
    return a;
}

void solve() {
    int n, m; cin >> n >> m;
    vector<string> s(n), t(n);
    rep(i, n)cin >> s[i];
    rep(i, n)cin >> t[i];
    {
        auto vs = s;
        auto vt = t;
        sort(all(vs));
        sort(all(vt));
        if (vs == vt) {
            vector<pair<string, int>> ps, pt;
            rep(i, n)ps.push_back({ s[i],i });
            rep(i, n)pt.push_back({ t[i],i });
            sort(all(ps));
            sort(all(pt));
            vector<int> anss(n), anst(n);
            rep(i, n)anss[i] = ps[i].second+1, anst[i] = pt[i].second+1;
            coutarray(anss);
            coutarray(anst);
            return;
        }
    }
    auto calc = [&](vector<ar>& v, int l, int r) {
        ar res = v[l] - v[r] * rhs[r - l];
        return res;
    };
    vector<vector<ar>> rs(n, vector<ar>(m + 1));
    auto rt = rs;
    rep(i, n) {
        rs[i][m] = { 0,0 };
        per(j, m) {
            int c = s[i][j] - 'a';
            rs[i][j] = rs[i][j + 1] * rhs[1] + ar{c,c};
            c = t[i][j] - 'a';
            rt[i][j] = rt[i][j + 1] * rhs[1] + ar{c,c};
        }
    }
    rep1(d, m - 1) {
        vector<ar> pre, las;
        rep(i, n) {
            pre.push_back(calc(rs[i], 0, d));
            pre.push_back(calc(rt[i], m - d, m));
            las.push_back(calc(rs[i], d, m));
            las.push_back(calc(rt[i], 0, m - d));
        }
        sort(all(pre)); pre.erase(unique(all(pre)), pre.end());
        sort(all(las)); las.erase(unique(all(las)), las.end());
        vector<vector<int>> g(2 * n + pre.size() + las.size());
        rep(i, n) {
            ar val = calc(rs[i], 0, d);
            int loc = lower_bound(all(pre), val) - pre.begin();
            g[2 * n + loc].push_back(i);
            val = calc(rt[i], m - d, m);
            loc = lower_bound(all(pre), val) - pre.begin();
            g[i + n].push_back(2 * n + loc);
            val = calc(rs[i], d, m);
            loc = lower_bound(all(las), val) - las.begin();
            g[i].push_back(2 * n + pre.size() + loc);
            val = calc(rt[i], 0, m - d);
            loc = lower_bound(all(las), val) - las.begin();
            g[2 * n + pre.size() + loc].push_back(i + n);
        }
        vector<int> deg(g.size());
        uf u(g.size());
        rep(i, g.size())for (int to : g[i]) {
            deg[i]++; deg[to]--;
            u.unite(i, to);
        }
        bool valid = true;
        rep(i, g.size()) {
            if (!u.same(0, i) || deg[i] != 0) {
                valid = false; break;
            }
        }
        if (!valid)continue;
        vector<int> trail;
        function<void(int)> dfs = [&](int id) {
            while (!g[id].empty()) {
                int to = g[id].back(); g[id].pop_back();
                dfs(to);
            }
            trail.push_back(id);
        };
        dfs(0);
        reverse(all(trail));
        vector<int> anss, anst;
        for (int id : trail) {
            if (id < n)anss.push_back(id + 1);
            else if (id < 2 * n)anst.push_back(id - n + 1);
        }
        anss.pop_back();
        coutarray(anss);
        coutarray(anst);
        return;
    }
    cout << -1 << "\n";
}



signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed<<setprecision(10);
    //init_f();
    init();
    //init2();
    //while(true)
    //expr();
    int t; cin >> t; rep(i, t)
    solve();
    return 0;
}