#include <cstdio>

#include <vector>

#define maxn 100010

#define maxm 1000010

int head[maxn], cnt = 1;

struct Edge {

	int to, nxt;

	bool vis;

} e[maxm << 1];

inline void add(int a, int b) {

	e[++cnt] = (Edge) {b, head[a], false}; head[a] = cnt;

}

int n, m, ind[maxn];

int CNT, num[maxn];

std::vector<int> ans[maxn];

int S[maxn], top;

bool ins[maxn];

void dfs(int u) {

	int v;

	if (ins[u]) {

		CNT++;

		do {

			num[CNT]++;

			ins[v = S[top--]] = false;

			ind[v] -= 2;

			ans[CNT].push_back(v);

		} while (v != u);

	}

	ins[S[++top] = u] = true;

	for (int &i = head[u]; i; i = e[i].nxt) {

		if (!e[i].vis) {

			v = e[i].to;

			e[i].vis = e[i ^ 1].vis = true;

			dfs(v);

			return ;

		}

	}

	ins[u] = false;

}

int main() {

	scanf("%d%d", &n, &m);

	for (int i = 0, a, b, c, d; i < m; i++) {

		scanf("%d%d%d%d", &a, &b, &c, &d);

		if (c != d) {

			ind[a]++, ind[b]++;

			add(a, b);

			add(b, a);

		}

	}

	for (int i = 1; i <= n; i++) if (ind[i] & 1) {

		puts("NIE");

		return 0;

	}

	for (int i = 1; i <= n; i++) while (ind[i]) dfs(i);

	printf("%d\n", CNT);

	for (int i = 1; i <= CNT; i++) {

		printf("%d", num[i]);

		for (int j = 0; j < num[i]; j++) printf(" %d", ans[i][j]);

		printf(" %d\n", ans[i][0]);

	}

	return 0;

}