#include <bits/stdc++.h>
using namespace std;

#define int long long

int t, n, m, k, x, a[505], match[505][505], tog[505], vis[505];
vector<int> G[505];
int dfs(int x) {
	if (exchange(vis[x], 1)) {
		return 0;
	}
	for (auto y : G[x]) {
		for (int i = 0; i < a[y]; i++) {
			if (!match[y][i] || dfs(match[y][i])) {
				match[y][i] = x;
				return 1;
			}
		}
	}
	return 0;
}
signed main() {
	scanf("%lld", &t);
	while (t--) {
		memset(tog, 0, sizeof(tog));
		memset(match, 0, sizeof(match));
		scanf("%lld%lld", &n, &m);
		for (int i = 1; i <= m; i++) {
			scanf("%lld", &a[i]);
		}
		for (int i = 1; i <= n; i++) {
			G[i].clear();
			scanf("%lld", &k);
			while (k--) {
				scanf("%lld", &x);
				G[i].push_back(x);
			}
		}
		int ans = 0;
		for (int i = 1; i <= n; i++) {
			memset(vis, 0, sizeof(vis));
			ans += dfs(i);
		}
		printf("%lld\n", ans);
		for (int i = 1; i <= m; i++) {
			for (int j = 0; j < a[i]; j++) {
				if (match[i][j]) {
					tog[match[i][j]] = i;
				}
			}
		}
		memset(vis, 0, sizeof(vis));
		while (true) {
			for (int i = 1; i <= n; i++) {
				if (vis[i] || !tog[i]) {
					continue;
				}
				for (auto x : G[i]) {
					if (a[x] && x != tog[i]) {
						break;
					} else if (a[x]) {
						printf("%lld ", i);
						vis[i] = 1;
						a[tog[i]]--;
						goto aaa;
					}
				}
			}
			break;
			aaa:;
		}
		puts("");
	}
}