// itst/isitcorrect.cpp
#include<bits/stdc++.h>
using namespace std;

const int _ = 2003 , __ = _ * _; int T , N , M; vector < int > pset[__]; bool vis[_]; int seq[_] , matr[_][_];
#define pre(x) ((x) == 1 ? N : (x) - 1)
#define nxt(x) ((x) == N ? 1 : (x) + 1)
bool check(int x){return matr[seq[x]][seq[nxt(x)]] != 0 && matr[seq[x]][seq[nxt(x)]] == matr[seq[nxt(x)]][seq[nxt(nxt(x))]];}
bool check(int x , int y){
	if(seq[x]) return 0;
	seq[x] = y; bool f = !check(pre(pre(x))) && !check(pre(x)) && !check(x);
	if(!f) seq[x] = 0;
	return f;
}
bool check(){for(int i = 1 ; i <= N ; ++i){if(check(i)) return 0;} return 1;}

mt19937 rnd(1);
bool solve(){
	int pos = 2;
	for(int i = 1 ; i <= N ; ++i){seq[i] = 0; vis[i] = 0;}
	for(int i = 1 ; i <= M ; ++i){
		if(find(pset[i].begin() , pset[i].end() , seq[pos]) == pset[i].end()) pos = pre(pos);
		shuffle(pset[i].begin() , pset[i].end() , rnd);
		for(auto t : pset[i]) 
			if(!vis[t]){
				vis[t] = 1; 
				int cnt = 0; while(cnt < N && !check(pos , t)){pos = nxt(pos); ++cnt;}
				if(cnt == N){
					int cur = 1; while(seq[cur]) ++cur;
					pos = cur; if(!seq[N]) cur = N;
					int p = 1; seq[cur] = t;
					while(p < cur){
						swap(seq[p] , seq[cur]);
						if(check()) break;
						swap(seq[p++] , seq[cur]);
					}
					if(p == cur) return 0;
				}
			}
	}
	for(int i = 1 ; i <= N ; ++i)
		if(!vis[i]){int cnt = 0; while(cnt < N && !check(pos , i)){pos = nxt(pos); ++cnt;}}
	for(int i = 1 ; i <= N ; ++i) cout << seq[i] << " \n"[i == N];
	return 1;
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	for(cin >> T ; T ; --T){
		cin >> N >> M; bool flg = 0;
		for(int i = 1 ; i <= N ; ++i) for(int j = 1 ; j <= N ; ++j) matr[i][j] = 0;
		for(int i = 1 ; i <= M ; ++i){
			int k; cin >> k; pset[i].clear();
			for(int j = 1 ; j <= k ; ++j){int x; cin >> x; pset[i].push_back(x);}
			for(auto p : pset[i]) for(auto q : pset[i]) matr[p][q] = i;
			flg |= pset[i].size() * 3 > 2 * N;
		}
		if(flg) cout << "-1\n";
		else{
			sort(pset + 1 , pset + M + 1 , [&](vector < int > &x , vector < int > &y){return x.size() > y.size();});
			while(!solve());
		}
	}
	
	return 0;
}