#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n, m;
    std::cin >> n >> m;
    
    std::vector<int> b(m);
    for (int i = 0; i < m; i++) {
        std::cin >> b[i];
        b[i] = std::min(b[i], n);
    }
    
    std::vector yx(m, std::vector<int>());
    std::vector<std::pair<int, int>> xy(n, {-1, -1});
    for (int i = 0; i < m; i++) {
        yx[i].resize(b[i], -1);
    }
    
    std::vector<std::vector<int>> a(n);
    for (int i = 0; i < n; i++) {
        int k;
        std::cin >> k;
        a[i].resize(k);
        for (int j = 0; j < k; j++) {
            std::cin >> a[i][j];
            a[i][j]--;
        }
    }
    
    std::vector<int> vis(n);
    std::vector<int> cur(m);
    int ans = 0;
    auto dfs = [&](auto &&self, int x) -> bool {
        if (vis[x]) {
            return false;
        }
        vis[x] = 1;
        for (auto y : a[x]) {
            for (int &i = cur[y]; i < b[y]; i++) {
                int j = i;
                if (yx[y][j] == -1 || self(self, yx[y][j])) {
                    yx[y][j] = x;
                    xy[x] = {y, j};
                    return true;
                }
            }
        }
        return false;
    };
    for (int x = 0; x < n; x++) {
        if (dfs(dfs, x)) {
            ans++;
            vis.assign(n, 0);
            cur.assign(m, 0);
        }
    }
    vis.assign(n, 0);
    cur.assign(m, 0);
    std::cout << ans << "\n";
    int tot = 0;
    std::vector<int> p;
    while (tot < ans) {
        for (int i = 0; i < n; i++) {
            if (xy[i].first == -1 || vis[i]) {
                continue;
            }
            int ok = 1;
            for (int j = 0; ; j++) {
                if (a[i][j] == xy[i].first) {
                    if (cur[a[i][j]] < xy[i].second) {
                        ok = 0;
                    }
                    break;
                }
                if (cur[a[i][j]] < b[a[i][j]]) {
                    ok = 0;
                    break;
                }
            }
            if (ok) {
                p.push_back(i);
                tot++;
                vis[i] = 1;
                cur[xy[i].first]++;
                break;
            }
        }
    }
    for (int i = 0; i < n; i++) {
        if (xy[i].first == -1) {
            p.push_back(i);
        }
    }
    for (int i = 0; i < n; i++) {
        std::cout << p[i] + 1 << " \n"[i == n - 1];
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int T;
    std::cin >> T;
    
    while (T--) {
        solve();
    }
    
    return 0;
}