// Problem: P9697 [GDCPC2023] Canvas
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P9697
// Memory Limit: 1 MB
// Time Limit: 3000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<int, int> pii;

const int maxn = 500100;

int n, m, deg[maxn], b[maxn];
bool vis[maxn], mk[maxn];
vector<pii> G[maxn];

struct node {
	int l, x, r, y;
	node(int a = 0, int b = 0, int c = 0, int d = 0) : l(a), x(b), r(c), y(d) {}
} a[maxn];

int dfn[maxn], low[maxn], scc[maxn], cnt, times, stk[maxn], top;

void tarjan(int u) {
	dfn[u] = low[u] = ++times;
	stk[++top] = u;
	for (pii p : G[u]) {
		int v = p.fst;
		if (!dfn[v]) {
			tarjan(v);
			low[u] = min(low[u], low[v]);
		} else if (!scc[v]) {
			low[u] = min(low[u], dfn[v]);
		}
	}
	if (low[u] == dfn[u]) {
		++cnt;
		while (1) {
			int x = stk[top--];
			scc[x] = cnt;
			if (x == u) {
				break;
			}
		}
	}
}

vector<int> ans;

void dfs(int u) {
	vis[u] = 1;
	for (pii p : G[u]) {
		int v = p.fst, id = p.scd;
		ans.pb(id);
		if (!vis[v]) {
			dfs(v);
		}
	}
}

void solve() {
	scanf("%d%d", &n, &m);
	times = cnt = top = 0;
	for (int i = 1; i <= n; ++i) {
		vector<pii>().swap(G[i]);
		vis[i] = mk[i] = 0;
		dfn[i] = low[i] = stk[i] = scc[i] = deg[i] = b[i] = 0;
	}
	vector<int> R;
	vector<int>().swap(ans);
	for (int i = 1, l, r, x, y; i <= m; ++i) {
		scanf("%d%d%d%d", &l, &x, &r, &y);
		a[i] = node(l, x, r, y);
		if (x > y) {
			swap(l, r);
			swap(x, y);
		}
		if (x == 1 && y == 1) {
			R.pb(i);
		} else if (x == 2 && y == 2) {
			ans.pb(i);
			mk[l] = mk[r] = 1;
		} else {
			G[l].pb(r, i);
		}
	}
	for (int i = 1; i <= n; ++i) {
		if (!dfn[i]) {
			tarjan(i);
		}
	}
	for (int u = 1; u <= n; ++u) {
		for (pii p : G[u]) {
			int v = p.fst;
			if (scc[u] != scc[v]) {
				++deg[scc[v]];
			}
		}
	}
	for (int i = 1; i <= n; ++i) {
		if (!deg[scc[i]] && !vis[i] && mk[i]) {
			dfs(i);
		}
	}
	for (int i = 1; i <= n; ++i) {
		if (!deg[scc[i]] && !vis[i]) {
			dfs(i);
		}
	}
	for (int x : R) {
		ans.pb(x);
	}
	reverse(ans.begin(), ans.end());
	for (int i : ans) {
		b[a[i].l] = a[i].x;
		b[a[i].r] = a[i].y;
	}
	int s = 0;
	for (int i = 1; i <= n; ++i) {
		s += b[i];
	}
	printf("%d\n", s);
	for (int x : ans) {
		printf("%d ", x);
	}
	putchar('\n');
}

int main() {
	int T = 1;
	scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}