#include<bits/stdc++.h>
using namespace std;
mt19937 rnd(0x66ccff);
const int N=505;
int T,n,m,p[N][N],q[N],a[N][N],c[N],b[N],np[N],ans,r[N];
vector<int>e[N];
bool vis[N],dl[N];
bool dfs(int x){
	for(auto v:e[x])if(!vis[v]){
		vis[v]=true;
		if(np[v]){
			p[v][np[v]--]=x,q[x]=v;
			return true;
		}
		for(int j=1;j<=b[v];++j)if(dfs(p[v][j])){
			p[v][j]=x,q[x]=v;
			return true;
		}
	}
	return false;
}
void solve(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;++i){
		scanf("%d",&b[i]);
		np[i]=b[i];
		for(int j=1;j<=b[i];++j)p[i][j]=0;
	}
	for(int i=1;i<=n;++i){
		scanf("%d",&c[i]);
		dl[i]=false,e[i].clear();
		for(int j=1;j<=c[i];++j){
			scanf("%d",&a[i][j]);
			e[i].emplace_back(a[i][j]);
		}
	}
	ans=0;
	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j)vis[j]=false;
		ans+=dfs(i);
	}
	printf("%d\n",ans);
	for(int i=1;i<=n;++i){
		vector<int>tmp;
		int o=0;
		for(int j=1;j<=n;++j)if(!dl[j]){
			r[j]=0;
			for(int k=1;k<=c[j];++k)if(b[a[j][k]]){
				r[j]=a[j][k];
				break;
			}
			if(!r[j]){
				o=j;
				break;
			}
			if(q[j])tmp.emplace_back(j);
		}
		if(o){
			dl[o]=true;
			printf("%d%c",o," \n"[i==n]);
			continue;
		}
		while(1){
			for(auto v:tmp)if(q[v]==r[v]||np[r[v]]){
				o=v;
				break;
			}
			if(o){
				int v=r[o];
				if(q[o]!=v)q[o]=v,p[v][np[v]--]=o;
				for(int j=b[v];j;--j)if(p[v][j]==o){
					for(int k=j;k<b[v];++k)p[v][k]=p[v][k+1];
					break;
				}
				--b[v];
				break;
			}
			for(auto v:tmp){
				e[v].clear();
				e[v].emplace_back(q[v]);
				e[v].emplace_back(r[v]);
				if(rnd()&1)swap(e[v][0],e[v][1]);
			}
			shuffle(tmp.begin(),tmp.end(),rnd);
			for(int j=1;j<=m;++j){
				for(int k=np[j];k<=b[j];++k)p[j][k]=0;
				np[j]=b[j];
			}
			for(auto v:tmp){
				for(int j=1;j<=m;++j)vis[j]=false;
				assert(dfs(v));
			}
		}
		dl[o]=true;
		printf("%d%c",o," \n"[i==n]);
	}
}
int main(){
	scanf("%d",&T);
	while(T--)solve();
	return 0;
}