#include <bits/stdc++.h>
using namespace std;
const int N=510,M=1e6+10,inf=1e9;
int a[N];
struct node{
    int to,nxt,val,w;
}e[M];
int head[N<<1],cnt=1,s,t;
void Add(int u,int v,int val,int w){
    e[++cnt]={v,head[u],val,w};
    head[u]=cnt;
}
void add(int u,int v,int val,int w){
    Add(u,v,val,w),Add(v,u,0,-w);
}
int vis[N<<1],d[N<<1];
int spfa(){
    queue<int>q;q.push(s);
    for(int i=s;i<=t;i++)d[i]=1e9;
    d[s]=0;
    int flag=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(e[i].val&&d[x]+e[i].w<d[v]){
                d[v]=d[x]+e[i].w;
                if(!vis[v])vis[v]=1,q.push(v);
                if(v==t)flag=1;
            }
        }
    }
    return flag;
}
int dinic(int x,int flow){
    if(x==t)return flow;
    int k,r=flow;
    vis[x]=1;
    for(int i=head[x];i;i=e[i].nxt){
        int v=e[i].to;
        if(vis[v]||d[v]!=d[x]+e[i].w||!e[i].val)continue;
        k=dinic(v,min(e[i].val,r));
        if(!k)d[v]=inf;
        e[i].val-=k;e[i^1].val+=k;
        r-=k;if(!r)break;
    }
    vis[x]=0;
    return flow-r;
}
vector<int>cho[N];
vector<int>b[N<<1];
int du[N<<1];
void solve(){
    int n,m;cnt=1;
    scanf("%d%d",&n,&m);
    t=n+m+1;
    for(int i=1;i<=m;i++)scanf("%d",&a[i]),add(i+n,t,a[i],0);
    for(int i=1;i<=n;i++){
        int X;scanf("%d",&X);cho[i].clear();cho[i].push_back(0);
        for(int j=1;j<=X;j++){
            int x;scanf("%d",&x);
            add(i,x+n,1,j);
            cho[i].push_back(x);
        }
        add(s,i,1,0);
    }
    int ans=0;
    while(spfa())ans+=dinic(s,inf);
    printf("%d\n",ans);
    for(int i=1;i<=n;i++){
        int id=0;
        for(int j=head[i];j;j=e[j].nxt){
            // cout<<e[j].w<<" "<<e[j].val<<"\n";
            if(e[j].w&&!e[j].val){
                id=e[j].w;break;
            }
        }
        // cout<<id<<"\n";
        if(id){
            // cout<<id<<"\n";
            b[i].push_back(cho[i][id]+n);du[cho[i][id]+n]++;
            for(int j=1;j<id;j++)b[cho[i][j]+n].push_back(i),du[i]++;
        }else vis[i]=1;
    }
    queue<int>q;
    for(int i=1;i<=n+m;i++)if(!du[i]&&!vis[i])q.push(i);
    while(!q.empty()){
        int x=q.front();q.pop();if(x<=n)printf("%d ",x);
        for(int v:b[x]){
            du[v]--;
            if(!du[v])q.push(v);
        }
    }
    for(int i=1;i<=n;i++)if(vis[i])printf("%d ",i);
    printf("\n");
    for(int i=s;i<=t;i++)head[i]=0,b[i].clear(),vis[i]=0;cnt=1;
}
int main() {
    int t;
    scanf("%d",&t);
    while(t--)solve();
    return 0;
}