#include <bits/stdc++.h>

using namespace std;

const int N = 2005;

int n, m, z[N][N], p[N];

int calc(int x) {
    if (x < 1) x += n;
    if (x > n) x -= n;
    return z[p[x]][p[x % n + 1]] == z[p[x % n + 1]][p[(x + 1) % n + 1]];
}

signed main() {
    int T; scanf("%d", &T);
    while (T--) {
        int ok = 1, now = 0; scanf("%d%d", &n, &m);
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= n; ++j) z[i][j] = --now;
        }
        vector<int> bg;
        for (int i = 1, x; i <= m; ++i) {
            scanf("%d", &x);
            vector<int> c(x);
            for (auto &t : c) scanf("%d", &t);
            if (c.size() > bg.size()) bg = c;
            for (auto a : c) {
                for (auto b : c) z[a][b] = i;
            }
            ok &= (x * 3 <= n * 2);
        }
        if (!ok) {
            puts("-1");
            continue;
        }
        vector<int> va;
        for (int i = 1; i <= n; ++i) va.push_back(i);
        for (auto x : bg) va.erase(find(va.begin(), va.end(), x));
        mt19937 rnd;
        shuffle(bg.begin(), bg.end(), rnd);
        shuffle(va.begin(), va.end(), rnd);
        for (int i = 0; i < n; ++i) {
            if (!va.empty() && (bg.empty() || i % 3 == 2)) {
                p[i + 1] = va.back(), va.pop_back();
            } else {
                p[i + 1] = bg.back(), bg.pop_back();
            }
        }
        int cnt = 0;
        for (int i = 1; i <= n; ++i) cnt += calc(i);
        while (cnt) {
            int i = rnd() % n + 1, j = rnd() % n + 1, tc = cnt;
            tc -= calc(i - 2) + calc(i - 1) + calc(i) + calc(j - 2) + calc(j - 1) + calc(j);
            swap(p[i], p[j]);
            tc += calc(i - 2) + calc(i - 1) + calc(i) + calc(j - 2) + calc(j - 1) + calc(j);
            if (tc <= cnt) cnt = tc;
            else swap(p[i], p[j]);
        }
        for (int i = 1; i <= n; ++i) printf("%d%c", p[i], " \n"[i == n]);
    }
    return 0;
}