#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <cmath>
#include <bitset>
#include <cassert>
#include <numeric>

using namespace std;
typedef long long ll;
const int inf = 1e9;
template<class T>
struct MaxFlow {
    struct _Edge {
        int to;
        T cap;
        _Edge(int to, T cap) : to(to), cap(cap) {}
    };
     
    int n;
    std::vector<_Edge> e;
    std::vector<std::vector<int>> g;
    std::vector<int> cur, h;
     
    MaxFlow() {}
    MaxFlow(int n) {
        init(n);
    }
     
    void init(int n) {
        this->n = n;
        e.clear();
        g.assign(n, {});
        cur.resize(n);
        h.resize(n);
    }
     
    bool bfs(int s, int t) {
        h.assign(n, -1);
        std::queue<int> que;
        h[s] = 0;
        que.push(s);
        while (!que.empty()) {
            const int u = que.front();
            que.pop();
            for (int i : g[u]) {
                auto [v, c] = e[i];
                if (c > 0 && h[v] == -1) {
                    h[v] = h[u] + 1;
                    if (v == t) {
                        return true;
                    }
                    que.push(v);
                }
            }
        }
        return false;
    }
     
    T dfs(int u, int t, T f) {
        if (u == t) {
            return f;
        }
        auto r = f;
        for (int &i = cur[u]; i < int(g[u].size()); ++i) {
            const int j = g[u][i];
            auto [v, c] = e[j];
            if (c > 0 && h[v] == h[u] + 1) {
                auto a = dfs(v, t, std::min(r, c));
                e[j].cap -= a;
                e[j ^ 1].cap += a;
                r -= a;
                if (r == 0) {
                    return f;
                }
            }
        }
        return f - r;
    }
    void addEdge(int u, int v, T c) {
        g[u].push_back(e.size());
        e.emplace_back(v, c);
        g[v].push_back(e.size());
        e.emplace_back(u, 0);
    }
    T flow(int s, int t) {
        T ans = 0;
        while (bfs(s, t)) {
            cur.assign(n, 0);
            ans += dfs(s, t, std::numeric_limits<T>::max());
        }
        return ans;
    }
     
    std::vector<bool> minCut() {
        std::vector<bool> c(n);
        for (int i = 0; i < n; i++) {
            c[i] = (h[i] != -1);
        }
        return c;
    }
     
    struct Edge {
        int from;
        int to;
        T cap;
        T flow;
    };
    std::vector<Edge> edges() {
        std::vector<Edge> a;
        for (int i = 0; i < e.size(); i += 2) {
            Edge x;
            x.from = e[i + 1].to;
            x.to = e[i].to;
            x.cap = e[i].cap + e[i + 1].cap;
            x.flow = e[i + 1].cap;
            a.push_back(x);
        }
        return a;
    }
};

void solve()
{
    int n, m;
    cin >> n >> m;
    int b[m + 10];
    for (int i = 1; i <= m; i ++) cin >> b[i];
    MaxFlow<int> flow(n + m + 3);
    for (int i = 1; i <= n; i ++)
        flow.addEdge(n + m + 1, i, 1);
    for (int i = 1; i <= m; i ++)
        flow.addEdge(n + i, n + m + 2, b[i]);
    
    vector<int> a[n + 10];
    for (int i = 1; i <= n; i ++)
    {
        int k;
        cin >> k;
        while (k --)
        {
            int x;
            cin >> x;
            a[i].push_back(x);
            flow.addEdge(i, n + x, 1);
        }
    }

    int ans = flow.flow(n + m + 1, n + m + 2);
    cout << ans << '\n';
    int match[n + 10] = {0};
    bool st[n + 10] = {0};
    bool used[m + 10] = {0};
    for (int i = 1; i <= m; i ++)
        if (!b[i]) used[i] = true;
    
    auto e = flow.e;
    for (int i = 0; i < e.size(); i += 2)
    {
        if (!e[i].cap && e[i + 1].to <= n)
        {
            int u = e[i + 1].to, v = e[i].to - n;
            match[u] = v;
        }
    }

    set<int> del;
    int cnt = 0;
    vector<int> p;
    while (cnt < ans)
    {
        for (int i = 1; i <= n; i ++)
        {
            if (st[i]) continue;
            int fir = -1;
            for (int x : a[i])
                if (!used[x])
                {
                    fir = x;
                    break;
                }
            
            if (fir == match[i])
            {
                p.push_back(i);
                st[i] = true;
                b[fir] --;
                if (!b[fir]) used[fir] = true;
                cnt ++;
                break;
            }
        }
    }

    for (auto x : p) cout << x << ' ';
    for (int i = 1; i <= n; i ++)
        if (!st[i]) cout << i << ' ';
    cout << '\n';
}

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int tt = 1;
    cin >> tt;
    while (tt --)
    {
        solve();
    }
    return 0;
}