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

///#include <tryhardmode>
///#include <GODMODE::ON>

using namespace std;

ifstream fin ("ctc.in");
ofstream fout ("ctc.out");

const int NMAX=1e5+5;

vector<int>v[NMAX];
vector<int>tarj[NMAX];
vector<int>comp[NMAX];

stack<int>stiva;

bool viz[NMAX];

int kon;

void dfs(int p)
{
    viz[p]=true;
    for(auto i:v[p])
    {
        if(!viz[i])
            dfs(i);
    }
    stiva.push(p);
}

void dfsc(int p)
{
    viz[p]=true;
    comp[kon].push_back(p);
    for(auto i:tarj[p])
    {
        if(!viz[i])
            dfsc(i);
    }
}

int main()
{
    int n,m,i,j,x,y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
        tarj[y].push_back(x);
    }
    for(i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);
    for(i=0;i<=n+1;i++)
        viz[i]=0;
    while(!stiva.empty())
    {
        int p=stiva.top();
        if(!viz[p])
        {
            kon++;
            dfsc(p);
        }
        stiva.pop();
    }
    fout<<kon<<"\n";
    for(i=1;i<=kon;i++)
    {
        for(auto j:comp[i])
            fout<<j<<" ";
        fout<<"\n";
    }
    return 0;
}