#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#include<bits/stdc++.h>
#define op(x) ((x&1)?(x+1):(x-1))
using namespace std;
const int MAXN = 1010,MAXM = 1e6+10,INF = 1e9;
int T,n,m,s,t,b[MAXN],k[MAXN],a[MAXN][MAXN],rk[MAXN][MAXN];

int id[MAXN][MAXN];

struct E{ int u,v,c,w; }e[MAXM];
int fst[MAXN],nxt[MAXM],tot;

void adde(int u,int v,int c,int w){e[++tot] = (E){u,v,c,w}; nxt[tot] = fst[u]; fst[u] = tot;}
void link(int u,int v,int c,int w){adde(u,v,c,w); adde(v,u,0,-w);}
void init(){
    memset(fst,0,sizeof fst);
    for(int i=1;i<=tot;i++)nxt[i] = 0; 
    tot = 0;
}
int dis[MAXN],pre[MAXN],qu[MAXM*10],inq[MAXN],vis[MAXN],hd,rr;
int spfa(){
    fill(dis+1,dis+1+t,INF); dis[s] = 0,inq[s] = 1; hd = rr = 0; qu[rr++] = s;
    while(hd<rr){
        int u = qu[hd++]; inq[u] = 0;
        for(int j=fst[u],v;j;j=nxt[j])if(e[j].c){
            v = e[j].v;
            if(dis[v] > dis[u]+e[j].w){
                dis[v] = dis[u]+e[j].w;
                pre[v] = j;
                if(!inq[v])inq[v] = 1,qu[rr++] = v;
            }
        }
    }
    return dis[t] != INF;
}
int dfs(int u,int f){
    if(u==t || !f)return f;
    vis[u] = 1;
    int ans = 0;
    for(int j = fst[u];j;j=nxt[j]){
        int v = e[j].v;
        if(!vis[v] && e[j].c && dis[v] == dis[u]+e[j].w){
            int val = dfs(v,min(f,e[j].c));
            ans += val; f -= val;
            e[j].c -= val; e[op(j)].c += val;
            if(!f)break;
        }
    }
    vis[u] = 0;
    return ans;
}
void ek(){ while(spfa())dfs(s,INF); }

int arr[MAXN],f[MAXN],cnt;
int topo[MAXN],len,tmp[MAXN];

mt19937 rnd(time(NULL));

vector<int> g[MAXN]; int deg[MAXN];

void solve(){
    cin>>n>>m; for(int i=1;i<=m;i++)cin>>b[i]; memset(f,0,sizeof f);
    for(int i=1;i<=m;i++)for(int j=1;j<=n;j++)rk[i][j] = INF;
    for(int i=1;i<=n;i++){
        cin>>k[i];
        for(int j=1;j<=k[i];j++)cin>>a[i][j],rk[a[i][j]][i] = j;
    }
    //
    init(); s = n+m+1,t = s+1;
    for(int i=1;i<=m;i++)link(s,i,b[i],0);
    for(int i=1;i<=n;i++){
        for(int j=k[i];j>=1;j--)link(a[i][j],i+m,1,j),id[i][j] = tot-1;
        link(i+m,t,1,0); 
    }
    ek();
    cnt = 0;
    for(int i=1;i<=n;i++)for(int j=1;j<=k[i];j++)if(!e[id[i][j]].c)arr[++cnt] = i,f[i] = a[i][j];
    cout<<cnt<<endl;

    for(int i=1;i<=n;i++)deg[i] = 0,g[i].clear();
    for(int i=1;i<=cnt;i++)for(int j=1;j<=cnt;j++){
        int x = arr[i],y = arr[j];
        if(rk[f[y]][x] < rk[f[x]][x]){
            g[j].push_back(i); deg[i]++;
        }
    }
    len = 0; queue<int> qu;
    for(int i=1;i<=cnt;i++)if(!deg[i])qu.push(i),topo[++len] = i;
    while(qu.size()){
        int u = qu.front(); qu.pop();
        for(auto v : g[u])if(!(--deg[v]))qu.push(v),topo[++len] = v;
    }
    for(int i=1;i<=len;i++)cout<<arr[topo[i]]<<" "; for(int i=1;i<=n;i++)if(!f[i])cout<<i<<" "; cout<<endl;
}   

int main(){
    ios::sync_with_stdio(false); cin.tie(0);

    cin>>T;
    while(T--)solve();

    return 0;
}