#pragma GCC optimize(2,3,"Ofast","inline","unroll-loops")
#include<bits/stdc++.h>
typedef int ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void write(ll x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const ll N=2009,INF=1e6;
ll n,m,b[N],a[N][N],to[N][N],rev[N][N],par[N],v[N],tim;
ll S,T,hd[N],tot=1,d[N],flow[N],in[N],mnc,mxf,cur[N];
struct Edg{
	ll to,nxt,f,c;
}es[N*N*2];
vector<ll>mch[N];
void init(){
    S=0,T=n+m+1;
    rep(i,0,T)hd[i]=0;
    tot=1;
    mnc=mxf=0;
}
void adde(ll x,ll y,ll f,ll c){
	es[++tot]=(Edg){y,hd[x],f,c};
	hd[x]=tot;
	es[++tot]=(Edg){x,hd[y],0,-c};
	hd[y]=tot;
}
bool spfa(){
	deque<ll>q;
	q.push_back(T);
	rep(i,0,T)d[i]=INF,in[i]=0;
	d[T]=0,in[T]=1;
	while(!q.empty()){
		ll u=q.front();q.pop_front();
		in[u]=0;
		for(ll i=hd[u];i;i=es[i].nxt){
			ll v=es[i].to,f=es[i^1].f,c=es[i^1].c;
			if(d[v]>d[u]+c&&f){
				d[v]=d[u]+c;
                // flow[v]=min(flow[u],f);
				// pre_v[v]=u,pre_e[v]=i;
				if(!in[v]){
                    in[v]=1;
                    if(!q.empty()&&d[v]<d[q.front()])q.push_front(v);
                    else q.push_back(v);
                }
                // if(v==T)return 1;
			}
		}
	}
	// return 0;
    return d[S]!=INF;
}
ll dinic(ll u,ll flow){
    if(u==T||!flow)return flow;
    in[u]=1;
    ll rst=flow,res=0;
    for(ll &i=cur[u];i;i=es[i].nxt){
        ll v=es[i].to,f=es[i].f,c=es[i].c;
        if(!in[v]&&f&&d[v]+c==d[u]){
            ll k=dinic(v,min(f,rst));
            if(k){
                mnc+=c*k;
                es[i].f-=k;
                es[i^1].f+=k;
                res+=k;
                rst-=k;
            }
            else d[v]=-INF*5;
            if(!rst){
                in[u]=0;
                return flow;
            }
        }
    }
    in[u]=0;
    return res;
}
void runflow(){
	while(spfa()){
        rep(i,0,T)cur[i]=hd[i];
        ll x;
        while((x=dinic(S,INF)))mxf+=x;
    }
}
void solve(ll x){
    if(v[x])return ;
    v[x]=1;
    for(ll y:mch[x]){
        ll qd=rev[y][x];
        rep(j,1,qd-1)solve(to[y][j]);
    }
    for(ll y:mch[x])par[++tim]=y;
}
void solve(){
    memset(v,0,sizeof(v));
    tim=0;
    n=read(),m=read();
    init();
    rep(i,1,m)b[i]=read(),adde(n+i,T,b[i],0);
    rep(i,1,n){
        adde(S,i,1,0);
        ll k=read();
        rep(j,0,m+1)rev[i][j]=0;
        rep(j,1,k){
            ll x=read();
            adde(i,x+n,1,j);
            to[i][j]=x,rev[i][x]=j;
        }
    }
    runflow();
    write(mxf),putchar('\n');
    rep(i,0,m+1)mch[i].clear();
    rep(i,1,n){
        ll fnd=0;
        for(ll j=hd[i];j;j=es[j].nxt){
            ll v=es[j].to,f=es[j].f;
            if(!f&&v>n){
                mch[v-n].push_back(i);
                fnd=1;
                continue;
            }
        }
        if(!fnd)mch[m+1].push_back(i);
    }
    // ll sum=0;
    // rep(i,1,m+1)sum+=mch[i].size();
    rep(i,1,m+1)solve(i);
    rep(i,1,n)write(par[i]),putchar(' ');
    putchar('\n');
}
bool Med;
int main(){
    // freopen("a.in","r",stdin);
    cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
    ll T=read();
    while(T--)solve();
    return 0;
}