#include<iostream>
#include<cstdio>
#include<vector>
#include<bitset>
#include<cstdlib>
#include<random>
#include<algorithm>
#define N 2000
using namespace std;
mt19937 RAND(random_device{}());
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int T,n,m,p[N+1],cl[N+1][N+1],rcnt[N+1],cnt[N+1],scnt[N+1],tong[N+1],length;
bool used[N+1];
bitset<N+1>B[N+1];
bitset<N+1>st;
vector<int>E[N+1];
bool check(int x,int y,int z)
{
	return !cl[x][y]||!cl[y][z]||cl[x][y]!=cl[y][z];
}
int main()
{
	int t,x,res;
	bool op;
	T=read();
	for (int qt=1;qt<=T;++qt)
	{
		n=read(),m=read(),op=1;
		for (int i=1;i<=n;++i) B[i].reset();
		for (int i=1;i<=m;++i)
		{
			rcnt[i]=t=read(),op&=(t*3<=(n<<1)),E[i].clear();
			while (t--) x=read(),B[x][i]=1,E[i].push_back(x);
		}
		if (!op)
		{
			puts("-1");
			continue;
		}
		for (int i=1;i<=n;++i)
			for (int j=i+1;j<=n;++j)
			{
				st=B[i]&B[j];
				if (!st.any()) cl[i][j]=cl[j][i]=0;
				else cl[i][j]=cl[j][i]=st._Find_first();
			}
		while (1)
		{
			op=1;
			for (int i=1;i<=m;++i) cnt[i]=rcnt[i];
			for (int i=1;i<=n;++i) used[i]=0;
			for (int i=1;i<=n;++i)
			{
				res=length=0;
				for (int j=1;j<=m;++j) res=max(res,cnt[j]);
				for (int j=1;j<=n;++j) scnt[j]=0;
				for (int j=1;j<=m;++j)
					if (res==cnt[j])
					{
						for (int k=0;k<E[j].size();++k) scnt[E[j][k]]++;
					}
				res=length=0;
				for (int j=1;j<=n;++j)
					if (!used[j]&&(i<=2||check(p[i-2],p[i-1],j)))
					{
						if (RAND()&1) res=max(res,scnt[j]);
					}
				for (int j=1;j<=n;++j)
					if (res>=scnt[j]&&!used[j]&&(i<=2||check(p[i-2],p[i-1],j)))
						tong[++length]=j;
				if (!length)
				{
					op=0;
					break;
				}
				p[i]=tong[RAND()%length+1],used[p[i]]=1;
				for (int j=1;j<=m;++j)
					if (B[p[i]][j])
						cnt[j]--;
			}
			if (op&&check(p[n],p[1],p[2])&&check(p[n-1],p[n],p[1])) break;
		}
		for (int i=1;i<=n;++i) printf("%d ",p[i]);
		puts("");
	}
	return 0;
}