#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
using LL = long long;

const int maxn = 505;
int match[maxn][maxn], cnt[maxn];
bool v[maxn];
vector<int> g[maxn];

bool find(int u){
    if (v[u]) return false;
    v[u] = true;
    for(auto j : g[u]){
        for(int k = 0; k < cnt[j]; k++){
            if (!match[j][k] or find(match[j][k])){
                match[j][k] = u;
                return true;
            }
        }
    }
    return false;
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int T;
    cin >> T;
    while(T--){
        int n, m;
        cin >> n >> m;
        for(int i = 1; i <= n; i++) g[i].clear();
        for(int i = 1; i <= m; i++){
            cin >> cnt[i];
            for(int j = 0; j < cnt[i]; j++){
                match[i][j] = 0;
            }
        }
        for(int i = 1; i <= n; i++){
            int k;
            cin >> k;
            while(k--){
                int x;
                cin >> x;
                g[i].push_back(x);
            }
        }
        int sum = 0;
        vector<int> q(n + 1);
        for(int i = 1; i <= n; i++){
            memset(v, 0, sizeof v);
            if (find(i)){
                sum += 1;
            }
        }
        for(int i = 1; i <= m; i++){
            for(int j = 0; j < cnt[i]; j++){
                q[match[i][j]] = i;
            }
        }
        memset(v, 0, sizeof v);
        vector<int> ans;
        vector<int> pt(n + 1);
        for(int _ = 0; _ < sum; _++){
            for(int i = 1; i <= n; i++){
                if (v[i] or q[i] == 0) continue;
                while(pt[i] < g[i].size() and cnt[g[i][pt[i]]] == 0) pt[i]++;
                if (g[i][pt[i]] == q[i]){
                    v[i] = true;
                    cnt[g[i][pt[i]]] -= 1;
                    ans.push_back(i);
                    break;
                }
            }
        }
        for(int i = 1; i <= n; i++){
            if (q[i] == 0){
                ans.push_back(i);
            }
        }
        cout << sum << '\n';
        for(auto x : ans) cout << x << ' ';
        cout << '\n';
    }

}