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

using namespace std;

ifstream f("ctc.in");
ofstream g("ctc.out");

vector<int> compcon[100000];
vector<int> v[100000];//v adiacenta
vector<int> t[100000];
int viz[100000],nr;//nr-numar comp con,viz vector vizitare
stack<int>s;

void dfs(int n)//dfs matricea mea
{
    viz[n] = 1;
    for(size_t i=0; i<v[n].size(); i++)
    {
        if(viz[v[n][i]]==0)
            dfs(v[n][i]);
    }
s.push(n);

}


void dfs_t(int n)//dfs transpusa
{
    compcon[nr].push_back(n);

    viz[n] = 2;

    for(int i=0; i<t[n].size(); i++)
    {
        if(viz[t[n][i]] == 1)
            dfs_t(t[n][i]);
    }
}

int main()
{
    int m,n,x,y;
    f>>n>>m;
    for(int i =1; i <=m ; i++)
    {
        f>>x>>y;
        t[y].push_back(x);//construiesc transpusa matricei mele
        v[x].push_back(y);//matricea mea(orientat-iau doar intr-un sens arcele)
    }



    for(int i = 1; i <= n; i++)
    {
        if(viz[i]==0)
            dfs(i);
    }



    while(s.empty()==0)
    {
        int n=s.top();
        if(viz[n])
        {
            nr=nr+1;
            dfs_t(n);
        }
        s.pop();
    }
    g<<nr<<endl;


    for(int i = 1; i <= nr; i++)
    {
        for(int j=0; j<compcon[i].size(); j++)
        {
            g<<compcon[i][j]<<" ";
        }

        g<<endl;
    }
}