#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e2 + 5;
int t[maxn];
int a[maxn][maxn], s[maxn];
int to[maxn], cnt[maxn];
int num[maxn][maxn], vis[maxn];
int ans = 0;
bool dfs(int now, int tag)
{
    if (vis[now] == tag)
        return false;
    vis[now] = tag;
    for (int i = 1; i <= s[now]; i++)
    {
        int v = a[now][i];
        for (int j = 1; j <= t[v]; j++)
            if (!num[v][j] || dfs(num[v][j], tag))
            {
                to[now] = v;
                num[v][j] = now;
                return true;
            }
    }
    return false;
}
int n, m;
int main()
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        memset(vis, 0, sizeof(vis));
        scanf("%d%d", &n, &m);
        for (int i = 1; i <= m; i++)
            scanf("%d", &t[i]);
        for (int i = 1; i <= n; i++)
        {
            scanf("%d", &s[i]);
            for (int j = 1; j <= s[i]; j++)
                scanf("%d", &a[i][j]);
        }
        for (int i = 1; i <= n; i++)
            if (dfs(i, i))
                ans++;
        printf("%d\n", ans);
        for (int i = 1; i <= n; i++)
            cnt[to[i]]++;

        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
            {
                if (vis[j])
                    continue;
                bool flag = true;
                for (int k = 1; a[j][k] != to[j]; k++)
                    if (cnt[a[j][k]])
                    {
                        flag = false;
                        break;
                    }
                if (flag)
                {
                    vis[j] = 1;
                    printf("%d ", j);
                    cnt[to[j]]--;
                    break;
                }
            }
        printf("\n");
    }
}