//just for test
#include<bits/stdc++.h>
#define LL long long
#define SZ(x) ((LL)(x.size()))
using namespace std;
long long read(){
  long long q=0,w=1;
  char ch=getchar();
  while(ch>'9' || ch<'0'){if(ch=='-')w=-1;ch=getchar();}
  while(ch>='0'&&ch<='9'){q=q*10+(ch-'0');ch=getchar();}
  return q*w;
}
void write(LL x){
  if(x<0){putchar('-');x=(-x);}
  if(x>9)write(x/10);
  putchar('0'+x%10);
}
void writeln(LL x){write(x);puts("");}
void writecs(LL x){write(x);putchar(' ');}
const long long N = 2e3+95;
const long long M = 4e6+95;
long long T,n,m,e[N][N];vector<LL>a[M];
bool cmp(LL x,LL y){return x<y;}
struct H{
  long long h[N],top;
  void clear(){top=0;}
  void ins(LL x){h[++top]=x;}
  void init(){
    sort(h+1,h+top+1,cmp);
    LL len=unique(h+1,h+top+1)-h-1;
    top=len;return ;
  }
  bool find(LL x){
    LL now=0;
    for(LL k=10;k>=0;k--)
      if(now+(1<<k)<=top&&h[now+(1<<k)]<=x)now+=(1<<k);
    return (h[now]==x);
  }
}dp[N];
bool check(LL x,LL y,LL z){//x<->y<->z.
  //  cout<<"> check: x = "<<x<<" y = "<<y<<" z = "<<z<<" e[x][y] = "<<e[x][y]<<" e[y][z] = "<<e[y][z]<<endl;
  if(!e[x][y])return true;
  if(!e[y][z])return true;
  return (e[x][y]!=e[y][z]);
}
#define ull unsigned long long
namespace GenHelper{
  ull seed=19260817ull;
  void Get(){
    seed^=(seed<<7);
    seed^=(seed>>11);
    seed^=(seed<<13);
    return ;
  }
  ull Rand(){Get();return (seed^(seed<<32ull));}
}
using GenHelper::Rand;
long long vc[N],top;
LL pre(LL x){return (x==1?top:(x-1));}
LL nxt(LL x){return (x==top?1:(x+1));}
bool vis[N];
void insert(LL x,LL v){
  for(LL i=top;i>x;i--)vc[i+1]=vc[i];
  vc[x+1]=v;top++;return ;
}
long long cnt[M],pA,pB,pC;
void build(){
  pA=pB=pC=0;
  for(LL i=1;i<=top;i++)
    cnt[e[vc[pre(i)]][vc[i]]]=0;
  for(LL i=1;i<=top;i++){
    LL col=e[vc[pre(i)]][vc[i]];
    cnt[col]++;
    if(cnt[col]==(top+2)/3){
      if(!pA)pA=col;
      else if(!pB)pB=col;
      else if(!pC)pC=col;
      else assert(0);
    }
  }
  return ;
}
LL qpre(LL x,LL k){
  if(k==1)return pre(x);
  if(k==2)return pre(pre(x));
  if(k==3)return pre(pre(pre(x)));
  return 0;
}
LL qnxt(LL x,LL k){
  if(k==1)return nxt(x);
  if(k==2)return nxt(nxt(x));
  if(k==3)return nxt(nxt(nxt(x)));
  return 0;
}
LL count(LL x,LL y,LL z){
  LL cnt=0;
  if(e[x][y])cnt++;
  if(e[y][z])cnt++;
  if(e[x][z])cnt++;
  return cnt;
}
const bool deb = false;
int main(){
  T=read();LL Tcnt=0;
  while(T--){
    Tcnt++;
    if(deb)cout<<" Tcnt = "<<Tcnt<<endl;
    n=read();m=read();
    for(LL i=1;i<=m;i++)a[i].clear();
    for(LL i=1;i<=n;i++)dp[i].clear();
    for(LL i=1;i<=n;i++)vis[i]=false;
    for(LL i=1;i<=n;i++)
      for(LL j=1;j<=n;j++)e[i][j]=0;
    if(deb)cout<<n<<" "<<m<<endl;
    for(LL x=1;x<=m;x++){
      LL k=read();
      if(deb)cout<<k<<" ";
      for(LL i=1;i<=k;i++){
	LL v=read();
	a[x].push_back(v);
	dp[v].ins(x);
	if(deb)cout<<v<<" ";
      }
      if(deb)cout<<endl;
    }
    //    if(Tcnt==93)return 0;
    for(LL x=1;x<=n;x++)
      dp[x].init();
    for(LL x=1;x<=m;x++)
      for(LL i=0;i<SZ(a[x]);i++)
	for(LL j=0;j<SZ(a[x]);j++)
	  if(i!=j)e[a[x][i]][a[x][j]]=x;
    LL px=0;
    for(LL i=1;i<=n;i++)
      if(!px||dp[i].top<dp[px].top)px=i;
    LL py=0;
    for(LL i=1;i<=n;i++){
      if(i==px)continue;
      if(!py||count(i,px,i)<count(i,px,py))py=i;
    }
    top=0;vc[++top]=px;vc[++top]=py;
    vis[px]=vis[py]=true;
    bool flag=false;LL pos=0;
    for(LL i=1;i<=n;i++){
      if(i==px||i==py)continue;
      if(check(px,py,i)&&check(py,i,px)&&check(i,px,py)){
	if(!pos||count(px,py,i)<count(px,py,pos))pos=i;
	flag=true;
      }
    }
    /*    for(LL i=1;i<=3;i++)
      cout<<vc[i]<<" ";
    cout<<endl;*/
    if(!flag){puts("-1");continue;}
    //    cout<<" pos = "<<pos<<endl;
    vc[++top]=pos;vis[pos]=true;
    while(top<n){
      build();flag=false;LL idx=0;
      for(LL i=n;i>=1;i--){
	if(vis[i])continue;
	if(pA&&dp[i].find(pA))continue;
	if(pB&&dp[i].find(pB))continue;
	if(pC&&dp[i].find(pC))continue;
	idx=i;flag=true;break;
      }
      //      cout<<" idx = "<<idx<<" top = "<<top<<endl;
      /*      for(LL i=1;i<=top;i++)
	cout<<" i = "<<i<<" qpre(i,2) = "<<qpre(i,2)<<" qpre(i,1) = "<<qpre(i,1)<<" qnxt(i,2) = "<<qnxt(i,2)<<" qnxt(i,1) = "<<qnxt(i,1)<<endl;*/
      /*      for(LL i=1;i<=top;i++)
	cout<<vc[i]<<" ";
      cout<<endl;*/
      if(!flag)break;
      /*      cout<<" idx = "<<idx<<" pA = "<<pA<<" pB = "<<pB<<" pC = "<<pC<<endl;
      for(LL i=1;i<=n;i++)
	cout<<" i = "<<i<<" e[idx][i] = "<<e[idx][i]<<endl;
      cout<<endl;*/
      flag=false;
      for(LL i=1;i<=top;i++)
	if(check(vc[pre(i)],vc[i],idx)&&check(vc[i],idx,vc[nxt(i)])&&check(idx,vc[nxt(i)],vc[nxt(nxt(i))])){
	  insert(i,idx);vis[idx]=flag=true;break;
	}
      if(flag)continue;
      //      assert(!(top&1));
      flag=false;
      for(LL i=1;i<=top;i++){
	//	cout<<"  qpre(pre(i),2) = "<<qpre(pre(i),2)<<" qpre(pre(i),1) = "<<qpre(pre(i),1)<<endl;
	//	cout<<"  i = "<<i<<" qpre(pre(i),1) = "<<qpre(pre(i),1)<<" pre(i) = "<<pre(i)<<endl;
	//	cout<<"  idx = "<<idx<<" nxt(i) = "<<nxt(i)<<" qnxt(nxt(i),1) = "<<qnxt(nxt(i),1)<<endl;
	if(check(vc[qpre(pre(i),2)],vc[qpre(pre(i),1)],vc[i])&&check(vc[qpre(pre(i),1)],vc[i],vc[pre(i)])&&check(vc[i],vc[pre(i)],idx)&&check(vc[pre(i)],idx,vc[nxt(i)])&&check(idx,vc[nxt(i)],vc[qnxt(nxt(i),1)])){
	  swap(vc[i],vc[pre(i)]);insert(i,idx);vis[idx]=true;flag=true;break;
	}
	if(check(vc[qpre(pre(i),2)],vc[qpre(pre(i),1)],vc[i])&&check(vc[qpre(pre(i),1)],vc[i],idx)&&check(vc[i],idx,vc[pre(i)])&&check(idx,vc[pre(i)],vc[nxt(i)])&&check(vc[pre(i)],vc[nxt(i)],vc[qnxt(nxt(i),1)])){
	  swap(vc[i],vc[pre(i)]);insert(pre(i),idx);vis[idx]=true;flag=true;break;
	}
      }
      /*      cout<<" now top = "<<top<<endl;
      for(LL i=1;i<=top;i++)
	cout<<vc[i]<<" ";
      cout<<endl;
      for(LL i=1;i<=top;i++)
	cout<<e[vc[pre(i)]][vc[i]]<<" ";
      cout<<endl;*/
    }
    if(!flag){puts("-1");continue;}
    for(LL i=1;i<=n;i++)
      writecs(vc[i]);
    puts("");
    //    for(LL i=1;i<=n;i++)vc[i]=0;
    //    if(Tcnt==93)break;
  }
  return 0;
}
/*
my test data:
input:
1
7 7
3 4 5 7 
3 1 4 6 
3 1 2 5 
3 2 6 7 
3 1 3 7 
3 2 3 4 
3 3 5 6 
1
7 7
3 1 2 3 
3 1 4 5 
3 2 5 6 
3 3 5 7 
3 2 4 7 
3 1 6 7 
3 3 4 6 

*/