#include <bits/stdc++.h>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int n,m;
int x[200005],y[200005];
vector <int> g[100005];
vector <int> gt[100005];
vector <int> ord;
bool viz[100005];
void dfs1(int u)
{
viz[u]=1;
for(int v:g[u])
{
if(viz[v]==0)
dfs1(v);
}
ord.push_back(u);
}
int nn;
vector <int> h[100005];
void dfs2(int u)
{
h[nn].push_back(u);
viz[u]=0;
for(int v:gt[u])
{
if(viz[v]==1)
dfs2(v);
}
}
int main()
{
fin>>n>>m;
for(int i=1; i<=m; i++)
{
fin>>x[i]>>y[i];
g[x[i]].push_back(y[i]);
gt[y[i]].push_back(x[i]);
}
for(int i=1; i<=n; i++)
{
if(viz[i]==0)
dfs1(i);
}
for(int i=ord.size()-1; i>=0; i--)
{
if(viz[ord[i]]==1)
{
nn++;
dfs2(ord[i]);
}
}
fout<<nn<<"\n";
for(int i=1; i<=nn; i++)
{
sort(h[i].begin(),h[i].end());
for(int j:h[i])
fout<<j<<" ";
fout<<"\n";
}
return 0;
}