#include <bits/stdc++.h>
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
int n,m;
vector<vector<int>>adj;
vector<vector<int>>adj_t;//transpus
vector<int>viz;
vector<int>stiva;
vector<int> componenta_curenta;
vector<vector<int>> toate_componentele;
void dfs1(int nod)
{
viz[nod]=1;
for(int i : adj[nod])
if(viz[i]==0)
dfs1(i);
stiva.push_back(nod);
}
void dfs2(int nod)
{
viz[nod]=1;
for(int i :adj_t[nod])
if(viz[i]==0)
dfs2(i);
componenta_curenta.push_back(nod);
}
int main()
{
f>>n>>m;
adj.resize(n + 1);
adj_t.resize(n + 1);
viz.resize(n + 1, 0);
for(int i=1;i<=m;i++)
{
int x,y;
f>>x>>y;
adj[x].push_back(y);
adj_t[y].push_back(x);
}
for (int i=1;i<=n;i++)
if (viz[i]==0) {
dfs1(i);
}
for(int i = 1; i <= n; i++) {
viz[i] = 0;
}
for(int i=stiva.size()-1;i>=0;i--) {
int nod=stiva[i];
if(viz[nod]==0)
{
componenta_curenta.clear();
dfs2(nod);
toate_componentele.push_back(componenta_curenta);
}
}
g << toate_componentele.size() << "\n";
for(int i=0;i<toate_componentele.size();i++){
for(int j = 0; j < toate_componentele[i].size(); j++) {
g << toate_componentele[i][j] << " ";
}
g<<"\n";
}
return 0;
}