#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<assert.h>
#include<ctime>
#define pb emplace_back
#define mp std::make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n';
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n';
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x, T2& ...y){ read(x); read(y...); }
const int N=1010;
const int inf=0x7fffffff;
const ll INF=0x7fffffffffffffff;
int S,T,tot;
int head[N],cur[N],lst[N],pre[N],vis[N],ent=1;
ll flow[N],dis[N];
struct Edge{
	int to,nxt;
	ll fl,co;
}e[1000010];
inline void adde(int x,int y,ll w,ll c){
	e[++ent]={y,head[x],w,c};head[x]=ent;
	e[++ent]={x,head[y],0,-c};head[y]=ent;
}
int ok[N];
bool SPFA(){
	for(int i=1;i<=tot;i++)lst[i]=pre[i]=ok[i]=0,dis[i]=flow[i]=INF,cur[i]=head[i];
	queue<int>q;
	q.push(S);dis[S]=0;
	while(!q.empty()){
		int x=q.front();q.pop();
		vis[x]=0;
		for(int i=head[x];i;i=e[i].nxt){
			int v=e[i].to;
			if(dis[v]>dis[x]+e[i].co&&e[i].fl){
				dis[v]=dis[x]+e[i].co;
				pre[v]=x;lst[v]=i;
				flow[v]=min(flow[x],e[i].fl);
				if(!vis[v]){
					q.push(v);
					vis[v]=1;
				}
			}
		}
	}
	return pre[T]>0;
}
int dfs(int x,int flow){
	if(x==T)return flow;
	int flo=0;
	ok[x]=1;
	for(int i=cur[x];i&&flo<flow;i=e[i].nxt){
		cur[x]=i;
		int v=e[i].to,w=e[i].fl;
		if(!ok[v] && dis[v]==dis[x]+e[i].co&&w){
			int fl=dfs(v,min(flow-flo,w));
			flo+=fl;e[i].fl-=fl;
			e[i^1].fl+=fl;
		}
	}
	ok[x]=0;
	return flo;
}
void MCMF(){
	ll mxfl=0;
	while(SPFA()){
		mxfl+=dfs(S,inf);
	}
	cout<<mxfl<<'\n';
}
int n,m,p[N],q[N],res[N],bo[N];
vi eg[N];
void solve(){
	ent=1;
	for(int i=1;i<=tot;i++)head[i]=lst[i]=pre[i]=vis[i]=flow[i]=dis[i]=0;
	tot=0;
	read(n,m);
	for(int i=1;i<=n;i++)p[i]=++tot;
	for(int i=1;i<=m;i++)q[i]=++tot;
	S=++tot;T=++tot;
	for(int i=1;i<=n;i++)adde(S,p[i],1,0);
	for(int i=1;i<=m;i++){
		int x;read(x);res[i]=x;
		adde(q[i],T,x,0);
	}
	for(int i=1;i<=n;i++){
		int k;read(k);
		vi().swap(eg[i]);
		for(int j=0;j<k;j++){
			int y;read(y);
			eg[i].pb(y);
			adde(p[i],q[y],1,j);
		}
	}
	MCMF();
	vpii vec;
	for(int x=1;x<=n;x++){
		int ok=0;
		for(int i=head[x];i;i=e[i].nxt){
			int v=e[i].to,fl=e[i].fl,co=e[i].co;
			if(!fl && v>=q[1] && v<=q[m]){
				ok=1;
				bo[x]=co;
			}
		}
		if(ok==0)bo[x]=-1;
	}
	vi ans;
	while(1){
		int ok=0;
		for(int i=1;i<=n;i++){
			int len=eg[i].size();
			for(int j=0;j<len;j++){
				if(res[eg[i][j]]==0)continue;
				else{
					if(j==bo[i]){
						--res[eg[i][j]];
						ans.pb(i);
						ok=1;
						bo[i]=-2;
					}
					break;
				}
			}
		}
		if(!ok)break;
	}
	for(int i=1;i<=n;i++)if(bo[i]==-1)ans.pb(i);
	for(int i:ans)cout<<i<<' ';
	cout<<'\n';
}
signed main(){
	// assert(freopen("data.in","r",stdin));
	int T;read(T);
	while(T--)solve();
    #ifdef do_while_true
		// cerr<<'\n'<<"Time:"<<clock()<<" ms"<<'\n';
	#endif
	return 0;
}