#include <cstdio>
#include <vector>
#include <bitset>

#define maxN 	100100

using namespace std;

vector <int> G[maxN], GT[maxN], S[maxN];
int N, M, T[maxN], Sol, Nr;
bitset <maxN> viz;

void df (int x) {
	viz[x] = 1;
       	T[x] = ++ Nr;
 	for (int i = 0; i < (int) G[x].size(); ++ i)
		if (!viz[G[x][i]])
			df(G[x][i]);
}

void df2 (int x) {
	S[Sol].push_back(x);
	viz[x] = 1;
	for (int i = 0; i < (int) GT[x].size(); ++ i)
		if (!viz[GT[x][i]])
			df2(GT[x][i]);
}

inline bool cmp (int a, int b) {
	return T[a] > T[b];
}

int main () {
        int i, a, b, j;

	freopen("ctc.in", "r", stdin);
	freopen("ctc.out", "w", stdout);

	scanf("%d%d", &N, &M);

	for (i = 1; i <= M; ++ i) {
		scanf("%d%d", &a, &b);
		G[a].push_back(b);
		GT[b].push_back(a);
	}

	df (1);

	for (i = 1; i <= N; ++ i)
		sort(GT[i].begin(), GT[i].end(), cmp);

	viz.reset ();

	for (i = 1; i <= N; ++ i)
		if (!viz[i]) {
			Sol ++;
			df2 (i);       
		}
	printf("%d\n", Sol);

	for (i = 1; i <= Sol; ++ i) {
		for (j = 0; j < (int) S[i].size(); ++ j)
			printf("%d ", S[i][j]);
		puts("");
	}
}