#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=l; i<=r; i++)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
using namespace std;

typedef long long ll;
typedef pair<ll,int> P;

const int N = 1000010;

vector <int> ef[N];
vector <P> eb[N];
P test[N];

int ans[N], tag[N], ss, tt, inq[N], sum, rere[N], yes[N], inst[N], num, bel[N];
ll low[N];
ll tim, dfn[N];
set<P> ksj;

void erase(int s) {
    queue <int> q;
    q.push(s);
    inq[s] = 1;
    ksj.erase(P(dfn[s], s));
    sum += 1;
    // cout <<s<<"#\n";
    while (!q.empty()) {
        int u = q.front();
        
        q.pop();
        ksj.erase(P(dfn[u], u));
        for (auto t: eb[u]) {
            int v = t.first;
            ans[t.second] = tt--;
            if (!inq[v]) q.push(v), inq[v] = 1,sum += 2;
        }
    }
}
stack<int> st;
void dfs(int u) {
    // cout <<u<<endl;
    dfn[u] = low[u] = ++tim;
    st.push(u), inst[u] = 1;
    for (auto v: ef[u]) {
        if (!dfn[v]) dfs(v), low[u] = min(low[u], low[v]);
        else if (inst[v]) low[u] = min(low[u], low[v]);
    }
    if (low[u] == dfn[u]) {
        int now;
        num++;
        do {
            now = st.top();
            st.pop();
            bel[now] = num;
            inst[now] = 0;
        } while (now != u);
    }
}

int main() {
    int T; scanf("%d", &T);
    while (T--) {
        int n, m; scanf("%d%d", &n, &m);
        ss = 1, tt = m;
        rep (i, 1, m) {
            int l, r, x, y;
            scanf("%d%d%d%d", &l, &x, &r, &y);
            yes[l] = yes[r] = 1;
            if (x == 1 && y == 1) {
                ans[i] = ss++;
            } 
            else if (x == 2 && y == 2) {
                ans[i] = tt--;
                tag[l] = tag[r] = 2;
            }
            else {
                if (x < y) swap(l, r), swap(x, y);
                ef[l].push_back(r);
                eb[r].push_back(P(l, i));
            }
        }
        // rep (i, 1, n) if (tag[i] == 2) sum += 2;

        rep (i, 1, n) {
            if (yes[i] && !dfn[i]) dfs(i), tim -= 2*n ;
        }
        // cout <<"dfn:\n";
        // rep (i, 1, n) cout << i<<':'<<dfn[i]<<" "<<low[i]<<endl;
        rep (i, 1, n) dfn[i] = bel[i];
        rep (i, 1, n) test[i] = P(low[i], bel[i]);
        sort(test+1, test+n+1);
        rep (i, 1, n) {
            int j=i;
            while (j < n && test[j+1].first == test[i].first) j++;
            rep (k, i, j) if (test[k].second != test[i].second) {
                cout << test[k].first <<' '<<test[k].second <<' '<< test[i].first <<' '<< test[i].second<<endl;
                return 0;
            }
        }
        rep (i, 1, n) {
            if (yes[i]) ksj.insert(P(dfn[i], i));//, cout << i << ' '<< dfn[i]<<"$$$\n";
        }

        rep (i, 1, n) {
            if (tag[i] == 2 && !inq[i]) {
                erase(i);
                
                sum += 1;
            }
        }
        
        
        while (ksj.size()) {
            int u = (*ksj.begin()).second;
            // cout <<u<<"$"<<endl;
            // ksj.erase(ksj.begin());
            erase(u);
        }
        cout << sum <<'\n';
        rep (i, 1, m) rere[ans[i]] = i;
        rep (i, 1, m) {
            cout << rere[i] <<' ';
        }
        cout <<'\n';
        rep (i, 1, n) inq[i] = tag[i] = low[i] = dfn[i] = inst[i] = 0, ef[i].clear(), eb[i].clear(), ef[i].shrink_to_fit(), eb[i].shrink_to_fit(), yes[i] =0;
        ksj.clear();
        // st.clear();
        while (st.size()) st.pop();
        rep (i, 1, m) ans[i] = 0;
        sum = 0;
        tim = 0;
        num=0;
    }

    return 0;
}

/*

2
4 4
1 1 2 2
3 2 4 1
1 2 3 2
2 1 4 1
4 2
3 2 4 1
1 2 3 1

1
10 15
5 2 7 2
1 2 2 1
1 2 4 1
4 2 5 1
2 1 6 2
2 1 4 2
2 2 3 1
1 1 3 2
1 2 8 1
3 1 8 2
8 1 10 2 
8 2 10 1
8 2 9 1
8 2 9 1
8 1 9 2

1
8 9
1 2 2 1
1 2 4 1
4 2 5 1
2 1 6 2
2 1 4 2
2 2 3 1
1 1 3 2
1 2 8 1
3 1 8 2

*/