#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=500+5,M=(1<<20)+5,K=1000+5,mod=912491249,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;

int n,m,B[N],C[N];
vector<int> e[N],mch[N];
int vis[N];
int dfs(int x){
	if(vis[x]) return 0;
	vis[x]=1;
	for(int i:e[x]){
		if(B[i]){mch[i][--B[i]]=x;return 1;}
		for(int j=0;j<mch[i].size();j++) if(dfs(mch[i][j])) return mch[i][j]=x,1;
	}
	return 0;
}
int ans[N],R[N];
void Solve(){
	int i,j;scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++) e[i].clear();
	for(i=1;i<=m;i++) mch[i].clear();
	for(i=1;i<=m;i++) scanf("%d",&B[i]),C[i]=B[i],mch[i].resize(B[i]);
	for(i=1;i<=n;i++){
		int len;scanf("%d",&len);
		e[i].resize(len);
		for(j=0;j<len;j++) scanf("%d",&e[i][j]);
	}
	int cnt=0;
	for(i=1;i<=n;i++){
		fill(vis+1,vis+n+1,0);
		cnt+=dfs(i);
	}
	Me(ans,0);
	for(i=1;i<=m;i++) for(j=0;j<mch[i].size();j++) if(mch[i][j]) ans[mch[i][j]]=i;
	for(i=1;i<=n;i++) gdb(ans[i]);
	printf("%d\n",cnt);
	Me(R,0);Me(vis,0);
	while(1){
		int flag=0;
		for(int i=1;i<=n;i++)if(ans[i]>0){
			while(!C[e[i][R[i]]]) R[i]++;
			if(e[i][R[i]]==ans[i]){printf("%d ",i);ans[i]=-1;C[e[i][R[i]]]--;flag=1;break;}
		}
		if(!flag) break;
	}
	for(int i=1;i<=n;i++) if(!ans[i]) printf("%d ",i);printf("\n");
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}