#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;

const int N = 5e2 + 7;
const int M = 4 * N * N + 10 * N;

typedef long long ll;

const ll inf = 1ll << 60;

struct E
{
    int next, to;
    ll f, dis;
} e[M << 1];

bool vis[N * 2];
int n, m, s, t, cnt = -1, head[N * 2], Ans[N], in[N];
ll ans = 0, cost = 0, dis[N * 2];

queue<int> Q;
vector<int> D[N], g[N];

inline void add(int id, int to, ll F, ll d)
{
    e[++cnt] = (E){head[id], to, F, d};
    head[id] = cnt;
    e[++cnt] = (E){head[to], id, 0, -d};
    head[to] = cnt;
}

bool SPFA()
{
    for (int i = s; i <= t; i++)
        dis[i] = inf, vis[i] = 0;
    Q.push(s), vis[s] = 1, dis[s] = 0;
    while (!Q.empty())
    {
        const int u = Q.front();
        Q.pop();
        vis[u] = 0;
        for (int i = head[u]; ~i; i = e[i].next)
        {
            int v = e[i].to;
            if (e[i].f && dis[v] > dis[u] + e[i].dis)
            {
                dis[v] = dis[u] + e[i].dis;
                if (!vis[v])
                    vis[v] = 1, Q.push(v);
            }
        }
    }
    return dis[t] != inf;
}

ll dfs(int u, ll lim)
{
    if (u == t)
        return lim;
    ll flow = 0;
    vis[u] = 1;
    for (int i = head[u]; ~i && lim; i = e[i].next)
    {
        const int v = e[i].to;
        if (dis[v] == dis[u] + e[i].dis && !vis[v] && e[i].f)
        {
            int f = dfs(v, min(lim, e[i].f));
            e[i].f -= f, e[i ^ 1].f += f;
            flow += f, lim -= f, cost += f * e[i].dis;
        }
    }
    vis[u] = 0;
    if (!flow)
        dis[u] = inf;
    return flow;
}

int main()
{
    // freopen("C.in", "r", stdin);
    // freopen("C_.in", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;
    // cout << T << "\n";
    while (T--)
    {
        cin >> n >> m;
        // cout << n << " " << m << "\n";
        s = 0, t = n + m + 1;
        cnt = -1;
        for (int i = s; i <= t; i++)
            head[i] = -1;
        for (int i = 1, flow_; i <= m; i++)
        {
            cin >> flow_;
            // cout << flow_ << " ";
            add(n + i, t, flow_, 0);
        }
        // cout << "\n";
        for (int i = 1, K; i <= n; i++)
        {
            cin >> K;
            // cout << K << " ";
            add(s, i, 1, 0);
            for (int j = 1, x; j <= K; j++)
            {
                cin >> x;
                // cout << x << " ";
                add(i, n + x, 1, j);
            }
            // cout << "\n";
        }
        ans = 0, cost = 0;
        while (SPFA())
            ans += dfs(s, inf);
        // cout << ans << " " << cost << "\n";
        cout << ans << "\n";
        for (int i = 1; i <= m; i++)
            D[i].clear();
        for (int u = 1; u <= n; u++)
        {

            g[u].clear();
            Ans[u] = -1, in[u] = 0;
            for (int i = head[u]; ~i; i = e[i].next)
            {
                if (!e[i].to)
                    continue;
                if (!e[i].f)
                    Ans[u] = e[i].to - n;
                else if (~Ans[u])
                    D[e[i].to - n].push_back(u);
            }
        }
        for (int u = 1; u <= n; u++)
            if (~Ans[u])
            {
                for (int v : D[Ans[u]])
                    g[u].push_back(v), in[v]++;
            }
        while (!Q.empty())
            Q.pop();
        for (int u = 1; u <= n; u++)
            if (!in[u] && ~Ans[u])
                Q.push(u);
        while (!Q.empty())
        {
            int u = Q.front();
            Q.pop();
            cout << u << " ";
            for (int v : g[u])
                if (!(--in[v]))
                    Q.push(v);
        }
        for (int u = 1; u <= n; u++)
            if (Ans[u] == -1)
                cout << u << " ";
        cout << "\n";
    }
}