#include <bits/stdc++.h>

using namespace std;

const int N = 5e5 + 5;

pair<int, int> E[N];
int a[N], b[N], vs[N], zz[N];
vector< pair<int, int> > G[N];
vector<int> z;

void dfs(int x)
{
    for (auto [v, w] : G[x]) {
        if (!vs[w]) {
            z.push_back(w);
            vs[w] = 1;
        }
        if (a[v] != 2) {
            a[v] = 2;
            dfs(v);
        }
    }
    return;
}

void dfs2(int x)
{
    for (auto [v, w] : G[x]) {
        if (!vs[w]) {
            z.push_back(w);
            vs[w] = 1;
            dfs2(v);
        }
    }
    return;
}

int dfn[N], low[N], inS[N], wh[N], du[N], id[N];
stack<int> S;

void tj(int x)
{
    dfn[x] = low[x] = ++dfn[0];
    inS[x] = 1;
    S.push(x);
    for (auto [v, w] : G[x]) {
        if (!dfn[v]) {
            tj(v);
            low[x] = min(low[x], low[v]);
        } else if (inS[v]) {
            low[x] = min(low[x], dfn[v]);
        }
    }
    if (dfn[x] == low[x]) {
        int v;
        ++wh[0];
        id[wh[0]] = x;
        do {
            v = S.top();
            S.pop();
            inS[v] = 0;
            wh[v] = wh[0];
        } while (v != x);
    }
    return;
}

signed main()
{
    int T;
    scanf("%d", &T);
    while (T--) {
        int n, m, q = 0;
        scanf("%d%d", &n, &m);
        for (int i = 1; i <= n; ++i) {
            a[i] = b[i] = 0;
            G[i].clear();
        }
        z.clear();
        vector<int> tz;
        for (int i = 1; i <= m; ++i) {
            vs[i] = 0;
            int l, x, r, y;
            scanf("%d%d%d%d", &l, &x, &r, &y);
            if (x == 1 && y == 1) {
                a[l] = a[r] = 1;
                tz.push_back(i);
                vs[i] = 1;
            } else if (x == 2 && y == 2) {
                b[l] = b[r] = 1;
                z.push_back(i);
                vs[i] = 1;
            } else {
                E[++q] = make_pair((x == 1 ? l : r), (y == 1 ? l : r));
                zz[q] = i;
                G[(x == 1 ? l : r)].push_back(make_pair((y == 1 ? l : r), i));
                a[l] = a[r] = 1;
            }
        }
        for (int i = 1; i <= n; ++i) {
            if (b[i]) {
                a[i] = 2;
            }
        }
        for (int i = 1; i <= n; ++i) {
            if (a[i] == 2) {
                dfs(i);
            }
        }
        int res = 0;
        for (int i = 1; i <= n; ++i) {
            res += a[i];
            G[i].clear();
            dfn[i] = low[i] = 0;
        }
        for (int i = 1; i <= q; ++i) {
            if (a[E[i].first] == 1 && a[E[i].second] == 1 && !vs[i]) {
                G[E[i].first].push_back(make_pair(E[i].second, zz[i]));
            }
        }
        dfn[0] = wh[0] = 0;
        for (int i = 1; i <= n; ++i) {
            if (!dfn[i]) {
                tj(i);
            }
        }
        for (int i = 1; i <= wh[0]; ++i) {
            du[i] = 0;
        }
        for (int i = 1; i <= q; ++i) {
            if (a[E[i].first] == 1 && a[E[i].second] == 1 && !vs[i] && wh[E[i].first] != wh[E[i].second]) {
                ++du[wh[E[i].second]];
            }
        }
        res += n;
        for (int i = 1; i <= wh[0]; ++i) {
            if (!du[i]) {
                --res;
                dfs2(id[i]);
            }
        }
        for (int i = 0; i < (int)tz.size(); ++i) {
            z.push_back(tz[i]);
        }
        for (int i = 1; i <= m; ++i) {
            if (!vs[i]) {
                z.push_back(i);
            }
        }
        printf("%d\n", res);
        for (int i = m - 1; ~i; --i) {
            printf("%d%c", z[i], " \n"[!i]);
        }
    }
    return 0;
}