#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
int inf=1000000007;
ll infl=1000000000000000007;
ll mod=1000000007;
ll mod1=998244353;

const int N=57;

bool is[N][N];

signed main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
    int tt;
    cin>>tt;
    while(tt--)
    {
        int n,m;
        cin>>n>>m;
        FOR(i,1,m)
        {
            int x;
            cin>>x;
            while(x--)
            {
                int k;
                cin>>k;
                is[i][k]=1;
            }
        }
        vector<int>p(n);
        FOR(i,1,n) p[i-1]=i;
        bool ans=0;
        while(true)
        {
            bool ok=1;
            FOR(i,1,m)
            {
                FOR(j,0,n-1) if(is[i][p[j]]&&is[i][p[(j+1)%n]]&&is[i][p[(j+2)%n]]) ok=0;
            }
            if(ok)
            {
                ans=1;
                break;
            }
            if(!next_permutation(all(p))) break;
        }
        if(!ans) cout<<-1<<endl;
        else
        {
            for(auto x:p) cout<<x<<" ";
            cout<<endl;
        }
        memset(is,0,sizeof is);
    }

	return 0;
}