#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pll = pair<ll, ll>;

#define fir first
#define sec second
#define mpr make_pair

#define vv vector
#define eb emplace_back

#define Fr(i, l, r) for (ll i = l; i <= r; ++i)
#define Rf(i, r, l) for (ll i = r; i >= l; --i)

template<typename T> void Min(T& x, T y) {
	if (y < x) x = y;
}

template<typename T> void Max(T& x, T y) {
	if (y > x) x = y;
}

using Type = long long;
using Result = pair<Type, Type>;

#define flow first
#define cost second

const int V = 100010, E = 2666666;
const Type INF = numeric_limits<Type>::max() / 2;

int ct = 1, hd[V], nxt[E], ver[E];
Type wt[E], cst[E], dis[V];
int pt, dS, dT, cur[V], vis[V];

void link(int u, int v, Type w, Type c) {
	ver[++ct] = v, nxt[ct] = hd[u], wt[ct] = w, cst[ct] = c, hd[u] = ct;
	ver[++ct] = u, nxt[ct] = hd[v], wt[ct] = 0, cst[ct] = -c, hd[v] = ct;
}

bool spfa() {
	static bool ins[V];
	memset(ins, 0, sizeof ins);
	fill(dis + 1, dis + pt + 1, INF), dis[dS] = 0;
	queue<int> q; q.push(dS);
	while (!q.empty()) {
		int x = q.front(); q.pop(), ins[x] = false;
		cur[x] = hd[x];
		for (int i = hd[x]; i; i = nxt[i]) {
			int y = ver[i];
			if (wt[i] == 0 || dis[y] <= dis[x] + cst[i]) continue;
			dis[y] = dis[x] + cst[i];
			if (ins[y] == false) q.push(y), ins[y] = true;
		}
	}
	return dis[dT] != INF;
}

Result dfs(int x, Type _f) {
	if (x == dT) return Result{_f, 0};
	vis[x] = 1;
	for (int i = cur[x]; i; i = nxt[i]) {
		int y = ver[i]; cur[x] = i;
		if (!wt[i] || dis[y] != dis[x] + cst[i] || vis[y]) continue;
		Result res = dfs(y, min(_f, wt[i]));
		if (res.flow) {
			wt[i] -= res.flow, wt[i ^ 1] += res.flow;
			return vis[x] = 0, res.cost += res.flow * cst[i], res;
		}
	}
	return vis[x] = 0, Result{0, 0};
}

Result dinic(int _S, int _T) {
	dS = _S, dT = _T;
	Result res = Result{0, 0}, tmp;
	while (spfa()) while (tmp = dfs(dS, INF), tmp.flow) {
		res.flow += tmp.flow, res.cost += tmp.cost;
	}
	return res;
}

int n, m, b[510];
int s[510], c[510], S, T;
int K[510], a[510][510];
int id[510][510];
int cho[510];
vv<int> bel[510];

void solve() {
	cin >> n >> m;
	Fr (i, 1, m) cin >> b[i];
	Fr (i, 1, n) s[i] = ++pt;
	Fr (i, 1, m) c[i] = ++pt;
	S = ++pt, T = ++pt;
	Fr (i, 1, n) link(S, s[i], 1, 0);
	Fr (i, 1, m) if (b[i]) link(c[i], T, b[i], 0);
	Fr (i, 1, n) {
		cin >> K[i];
		Fr (j, 1, K[i]) {
			cin >> a[i][j];
			link(s[i], c[a[i][j]], 1, j);
			id[i][a[i][j]] = ct - 1;
		}
	}
	Result tmp = dinic(S, T);
	cout << tmp.flow << '\n';
	Fr (i, 1, n) Fr (j, 1, m) if (id[i][j] && wt[id[i][j]] == 0) cho[i] = j, bel[j].eb(i);
	vv<vv<int>> G(n + 1);
	vv<int> deg(n + 1);
	Fr (i, 1, n) Fr (j, 1, K[i]) if (cho[i] == a[i][j]) {
		Fr (k, 1, j - 1) for (auto h : bel[a[i][k]]) G[h].eb(i), ++deg[i];
	}
	queue<int> q;
	vv<int> Ans;
	Fr (i, 1, n) if (deg[i] == 0) q.push(i);
	while (!q.empty()) {
		int x = q.front(); q.pop();
		Ans.eb(x);
		for (auto y : G[x]) {
			--deg[y];
			if (deg[y] == 0) q.push(y);
		}
	}
	assert((int)Ans.size() == n);
	Fr (i, 1, n) cout << Ans[i - 1] << " \n"[i == n];
}

void clear() {
	Fr (i, 0, pt) hd[i] = 0;
	pt = 0, ct = 1;
	memset(id, 0, sizeof id);
	memset(a, 0, sizeof a);
	memset(cho, 0, sizeof cho);
	Fr (i, 1, m) bel[i].clear();
}

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

	int T; cin >> T;
	while (T --> 0) solve(), clear();
	return 0;
}