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

using namespace std;

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

const int nmax= 100000;

int k, ksol= 0;
int index[nmax+1], lp[nmax+1];
stack <int> s;
vector <int> v[nmax+1], sol[nmax+1];

void dfs( int node ) {
    ++k;
    index[node]= lp[node]= k;
    s.push(node);

    for ( vector <int>::iterator it= v[node].begin(); it!=v[node].end(); ++it ) {
        if ( index[*it]==0 ) {
            //fout<<*it<<" 0\n";
            dfs(*it);
        } 
        //fout<<*it<<" 1\n";
        if ( lp[*it]<lp[node] ) {
            lp[node]= lp[*it];
        }
    }

    if ( index[node]==lp[node] ) {
        ++ksol;
        //fout<<ksol<<"\n"<<s.top()<<" ";
        while ( s.top()!=node ) {
            //fout<<s.top()<<" ";
            sol[ksol].push_back(s.top());
            s.pop();
        }
        sol[ksol].push_back(s.top());
        s.pop();
    }
}

int main(  ) {
    int n, m;
    fin>>n>>m;
    for ( int i= 1; i<=m; ++i ) {
        int x, y;
        fin>>x>>y;
        v[x].push_back(y);
    }

    for ( int i= 1; i<=n; ++i ) {
        if ( index[i]==0 ) {
            dfs(i);
        }
    }
    
    //fout<<"\n\n\n\n";
    fout<<ksol<<"\n";
    for ( int i= 1; i<=ksol; ++i ) {
        for ( vector <int>::iterator it= sol[i].begin(); it!=sol[i].end(); ++it ) {
            fout<<*it<<" ";
        }
        fout<<"\n";
      }

    return 0;
}