#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include"debug.h"
#else
#define debug(...) void()
#endif
#define all(x) (x).begin(),(x).end()
template<class T>
auto ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
using ll=long long;
using ull=unsigned ll;
const int N=5e2+10;
int T,n,m,b[N];
vector<int>a[N];
void init(){}
int vis[N],cur[N],match[N][N],to[N];
int find(int u){
	if(vis[u])return 0;
	vis[u]=1;
	for(int v:a[u]){
		for(int i=1;i<=b[v];i++){
			if(!match[v][i]||find(match[v][i])){
				return match[v][i]=u,1;
			}
		}
	}
	return 0;
}
void get(){
	cin>>n>>m;
	for(int i=1;i<=m;i++)cin>>b[i];
	for(int i=1,x;i<=n;i++){
		cin>>x,a[i].assign(x,0);
		for(int &j:a[i])cin>>j;
	}
	int ans=0;
	for(int i=1;i<=n;i++){
		fill(vis,vis+1+n,0);
		ans+=find(i);
	}
	cout<<ans<<endl;
	for(int i=1;i<=m;i++){
		for(int j=1;j<=b[i];j++){
			if(match[i][j])to[match[i][j]]=i;
		}
	}
	fill(cur,cur+1+n,0);
	fill(vis,vis+1+n,0);
	vector<int>res;
	for(;;){
		int p=[&](){
			for(int i=1;i<=n;i++)if(to[i]){
				for(;cur[i]<a[i].size()&&!b[a[i][cur[i]]];cur[i]++);
				if(cur[i]<a[i].size()&&a[i][cur[i]]==to[i])return i;
			}
			return 0;
		}();
		if(!p)break;
		b[to[p]]--,to[p]=0,vis[p]=1;
		res.push_back(p);
	}
	for(int i=1;i<=n;i++)if(!vis[i])res.push_back(i);
	for(int i=0;i<n;i++)cout<<res[i]<<"\n "[i+1<n];
}
void clr(){
	memset(match,0,sizeof match);
	fill(to,to+1+n,0);
}
int main(){
	for(cin>>T;T--;clr())get();
	return 0;
}
#ifdef DEBUG
#include"debug.hpp"
#endif