#include <bits/stdc++.h>
#define nmax 100001
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int n,m,timp[nmax],k,sol;
vector<int>a[nmax];
vector<int>b[nmax];
vector<int>c[nmax];
bitset<nmax>viz;
void Citire()
{
    int i,x,y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        a[x].push_back(y);
        b[y].push_back(x);///graful transpus
    }
}
void DFS_Timp(int varf)
{
    viz[varf]=1;
    for(int i=0;i<a[varf].size();i++)
        if(!viz[a[varf][i]])
            DFS_Timp(a[varf][i]);
    timp[++k]=varf;
}
void DFS_Rezolvare(int varf)
{
    int i;
    viz[varf]=1;
    for(i=0;i<b[varf].size();i++) ///parcurg graful transpus
        if(!viz[b[varf][i]])
            DFS_Rezolvare(b[varf][i]);
    c[sol].push_back(varf);
}
void Rezolvare()
{
    int i,j;
    for(i=1;i<=n;i++)
        if(!viz[i])
            DFS_Timp(i);
    viz.reset();
    for(i=k;i>=1;i--)
    {
        if(!viz[timp[i]])
        {
            sol++;
            DFS_Rezolvare(timp[i]);
        }
    }
    fout<<sol<<"\n";
    for(i=1;i<=sol;i++)
    {
        sort(c[i].begin(),c[i].end());
        for(j=0;j<c[i].size();j++)
            fout<<c[i][j]<<" ";
        fout<<"\n";
    }
}
int main()
{
    Citire();
    Rezolvare();
    fin.close();
    fout.close();
    return 0;
}