#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <algorithm>

using namespace std;

const int maxn = 100005;

vector <int> g[maxn], gt[maxn], discovered;
int n, m;
vector <vector <int> > ctc;
bitset <maxn> used;

inline void dfs(int node) {
	used[node] = 1;
	for(auto it : g[node])
		if(!used[it])
			dfs(it);
	discovered.push_back(node);
}

inline void dfs(int node, vector <int> &act) {
	act.push_back(node);
	used[node] = 0;
	for(auto it : gt[node])
		if(used[it])
			dfs(it, act);
}

inline void kosaraju() {
	ifstream fin("ctc.in");
	ofstream fout("ctc.out");
	fin >> n >> m;
	for(int i = 1 ; i <= m ; ++ i) {
		int x, y;
		fin >> x >> y;
		g[x].push_back(y);
		gt[y].push_back(x);
	}
	for(int i = 1 ; i <= n ; ++ i)
		if(!used[i])
			dfs(i);
	reverse(discovered.begin(), discovered.end());
	for(auto it : discovered)
		if(used[it]) {
			vector <int> act;
			dfs(it, act);
			ctc.push_back(act);
		}
	fout << ctc.size() << '\n';
	for(auto comp : ctc) {
		for(auto it : comp)
			fout << it << ' ';
		fout << '\n';
	}
}

int main() {
	kosaraju();
}