#include <bits/stdc++.h>

using namespace std;
typedef int ll;

void input(ll &n, ll &m, vector<vector<ll>> &clubs) {
    cin >> n >> m;
    clubs.resize(m);
    for (ll i = 0; i < m; i++) {
        ll s;
        cin >> s;
        clubs[i].resize(s);
        for (ll j = 0; j < s; j++) {
            cin >> clubs[i][j];
            clubs[i][j]--;
        }
    }
}

void solve47(ll n, vector<vector<ll>> &clubs) {
    ll a = (ll)clubs[0].size();
    ll b = n - a;
    if (a > 2 * b) {
        cout << "-1\n";
        return;
    }

    vector<bool> in(n, false);
    for (ll i : clubs[0])
        in[i] = true;

    vector<ll> alone;
    for (ll i = 0; i < n; i++)
        if (not in[i])
            alone.push_back(i);

    while (clubs[0].size() >= 2) {
        cout << clubs[0].back() + 1 << " ";
        clubs[0].pop_back();
        cout << clubs[0].back() + 1 << " ";
        clubs[0].pop_back();
        cout << alone.back() + 1 << " ";
        alone.pop_back();
    }
    if (not clubs[0].empty())
        cout << clubs[0].back() << " ";

    while (not alone.empty()) {
        cout << alone.back() + 1 << " ";
        alone.pop_back();
    }
    cout << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    ll T;
    cin >> T;
    while (T--) {
        ll n, m;
        vector<vector<ll>> clubs;
        input(n, m, clubs);

        if (m == 1) {
            solve47(n, clubs);
        }
    }
}