#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=2e3+7;
vector<int>V[LIM], P[LIM*LIM], T[LIM];
int ile[LIM*LIM], odw[LIM];
void solve() {
	int n, m;
	cin >> n >> m;
	if(m==0) {
		rep(i, n) cout << i+1 << " ";
		cout << '\n';
		return;
	}
	rep(i, n) odw[i]=0;
	rep(i, n) T[i].clear();
	rep(i, n) V[i].clear();
	rep(i, m) P[i].clear();
	pair<int,int>ma={0, 0};
	rep(i, m) {
		int k;
		cin >> k;
		ile[i]=k;
		ma=max(ma, {k, i});
		rep(j, k) {
			int x;
			cin >> x; --x;
			P[i].pb(x);
			V[x].pb(i);
		}
	}
	if(ma.st*3>2*n) {
		cout << -1 << '\n';
		return;
	}
	int z=ma.st;
	if(n-z<z) z=n-ma.st;
	vector<pair<int,int>>tmp;
	for(auto i : P[ma.nd]) tmp.pb({V[i].size(), i});
	sort(all(tmp));
	reverse(tmp.begin(), tmp.begin()+z);
	rep(i, tmp.size()) P[ma.nd][i]=tmp[i].nd;
	int akt=0;
	while(true) {
		ma={0, 0};
		rep(j, m) ma=max(ma, {(int)P[j].size(), j});
		if(ma.st==0) break;
		while(P[ma.nd].size()>0) {
			int x=P[ma.nd].back(); P[ma.nd].pop_back();
			if(odw[x]) continue;
			for(auto j : V[x]) --ile[j];
			odw[x]=1;
			T[akt].pb(x);
			akt=(akt+1)%z;
		}
	}
	rep(i, n) if(!odw[i]) {
		T[akt].pb(i);
		odw[i]=1;
		akt=(akt+1)%z;
	}
	rep(i, z) for(auto j : T[i]) cout << j+1 << " ";
	cout << '\n';
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int _=1;
	cin >> _;
	while(_--) solve();
}