//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
class MinCostMaxFlow
{
	private:
		struct edge
		{
			int u,v,capa,cost;
			edge(int _u,int _v,int _capa,int _cost)
			{
				u=_u;
				v=_v;
				capa=_capa;
				cost=_cost;
			}
			edge(){}
		}E[5005000];
		vector<int> G[1010];
		int p;
		int dist[1010];
		bool inque[1010];
		bool vis[1010];
		bool spfa(int s,int t)
		{
			memset(dist,inf,sizeof(dist));
			memset(inque,0,sizeof(inque));
			dist[s]=0;
			inque[s]=1;
			queue<int> q;
			q.push(s);
			while(!q.empty())
			{
				int x=q.front();
				q.pop();
				inque[x]=0;
				for(auto e:G[x])
					if(E[e].capa&&dist[x]+E[e].cost<dist[E[e].v])
					{
						dist[E[e].v]=dist[x]+E[e].cost;
						if(!inque[E[e].v])
						{
							q.push(E[e].v);
							inque[E[e].v]=1;
						}
					}
			}
			return dist[t]<inf;
		}
		int cost;
		int dfs(int u,int t,int flow)
		{
			if(u==t)
				return flow;
			vis[u]=1;
			int ans=0;
			for(auto e:G[u])
				if(!vis[E[e].v]&&E[e].capa&&dist[E[e].v]==dist[u]+E[e].cost)
				{
					int augflow=dfs(E[e].v,t,min(E[e].capa,flow-ans));
					if(augflow)
					{
						cost+=augflow*E[e].cost;
						E[e].capa-=augflow;
						E[e^1].capa+=augflow;
						ans+=augflow;
					}
				}
			vis[u]=0;
			return ans;
		}
	public:
		void clear()
		{
			p=0;
			for(int i=0;i<1010;i++)
				G[i].clear();
			memset(vis,0,sizeof(vis));
		}
		MinCostMaxFlow()
		{
			clear();
		}
		void addEdge(int u,int v,int capa,int cost)
		{
			G[u].pb(p);
			E[p++]=edge(u,v,capa,cost);
			G[v].pb(p);
			E[p++]=edge(v,u,0,-cost);
		}
		pii mcmf(int s,int t)
		{
			cost=0;
			int ans=0;
			while(spfa(s,t))
			{
				int x;
				while((x=dfs(s,t,inf)))	ans+=x;
			}
			return mp(ans,cost);
		}
		vector<int> get(int n,int m)
		{
			vector<int> res(n,inf);
			for(int i=1;i<=n;i++)
				for(auto e:G[i+m])
					if(E[e].v<=m&&E[e].capa)
						res[i-1]=-E[e].cost;
			return res;
		}
}mcmf;
int cnt[505];
vector<int> order[505];
vector<int> G[505];
vector<int> belong[505];
int indeg[505];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		mcmf.clear();
		int n,m;
		cin>>n>>m;
		for(int i=1;i<=m;i++)
		{
			int x;
			cin>>x;
			cnt[i]=x;
			mcmf.addEdge(0,i,x,0);
		}
		for(int i=1;i<=n;i++)
		{
			order[i].clear();
			int c;
			cin>>c;
			for(int j=1;j<=c;j++)
			{
				int v;
				cin>>v;
				order[i].pb(v);
				mcmf.addEdge(v,i+m,1,j);
			}
			mcmf.addEdge(i+m,n+m+1,1,0);
		}
		pii pr=mcmf.mcmf(0,n+m+1);
		vector<int> val=mcmf.get(n,m);
		for(int i=1;i<=m;i++)
			belong[i].clear();
		for(int i=0;i<n;i++)
			if(val[i]<=m)
				belong[order[i+1][val[i]-1]].pb(i+1);
		for(int i=1;i<=n;i++)
			G[i].clear();
		for(int i=1;i<=n;i++)
			if(val[i-1]<=m)
				for(int j=0;j<val[i-1]-1;j++)
					for(auto x:belong[order[i][j]])
					{
						G[x].pb(i);
						indeg[i]++;
					}
		queue<int> q;
		vector<int> ord;
		for(int i=1;i<=n;i++)
			if(!indeg[i])
				q.push(i);
		while(!q.empty())
		{
			int x=q.front();
			q.pop();
			ord.pb(x);
			for(auto y:G[x])
			{
				indeg[y]--;
				if(!indeg[y])
					q.push(y);
			}
		}
		int ans=0;
		for(auto ind:ord)
		{
			int p=0;
			while(p<sz(order[ind])&&!cnt[order[ind][p]]) p++;
			if(p<sz(order[ind]))
			{
				ans++;
				cnt[order[ind][p]]--;
			}
		}
		cout<<ans<<'\n';
		for(auto ind:ord)
			cout<<ind<<" ";
		cout<<'\n';
	}
	return 0;
}