#include <iostream>
#include <vector>
#include <fstream>
//Algoritmul lui Kosaraju
//complexitate: O(m+n)
using namespace std;
vector<vector<int> > G, GT;
int n , m , contor;
vector<bool> V;
vector<int> S;
vector<int> current_component;
void dfs(int k)
{
V[k] = true;
for(auto x : G[k])
if(!V[x])
dfs(x);
S.push_back(k);
}
void dfsGT(int k)
{
V[k] = true;
current_component.push_back(k);
for(auto x: GT[k])
if(! V[x])
dfsGT(x);
}
int main()
{
ifstream f ("ctc.in");
f >> n >> m;
G = GT = vector<vector<int>>(n + 1);
for(int i = 1 ; i <= m ; i++)
{
int a , b;
f >> a >> b;
G[a].push_back(b);
GT[b].push_back(a);
}
f.close();
V = vector<bool> (n + 1, false);
for(int i = 1 ; i <= n ; i ++)
if(! V[i])
dfs(i);
vector<vector<int>> ctc_list;
V = vector<bool> (n + 1, false);
for(auto it = S.rbegin(); it != S.rend(); ++it)
if(!V[*it]) {
contor ++;
current_component.clear();
dfsGT(*it);
ctc_list.push_back(current_component);
}
ofstream g("ctc.out");
g << contor << "\n";
for(const auto& comp : ctc_list)
{
for(int node : comp)
{
g << node << " ";
}
g << "\n";
}
g.close();
return 0;
}