#include<iostream>
#include<fstream>
#include<vector>
#include<stack>
using namespace std;
int n,id=0,ids[100010],low[100010],ctc=0;
vector <int> v[100010],cc[100010];
stack <int> S;
bool onStack[100010];
void dfs(int k){
    ids[k]=low[k]=++id; int i;
    S.push(k); onStack[k]=1;
    for(i=0;i<v[k].size();i++){
        if(!ids[v[k][i]]){
            dfs(v[k][i]);
            low[k]=min(low[k],low[v[k][i]]);
        }
        else if(onStack[v[k][i]]) low[k]=min(low[k],low[v[k][i]]);
    }
    if(ids[k]==low[k]){
        ctc++;
        while(1){
            cc[ctc].push_back(S.top());
            onStack[S.top()]=0;
            if(S.top()==k){
                S.pop();
                break;
            }
            S.pop();
        }
    }
}
int main(){
    int i,m,x,y,j;
    ifstream f("ctc.in");
    f>>n>>m;
    for(i=1;i<=m;i++){
        f>>x>>y;
        v[x].push_back(y);
    }
    f.close();

    for(i=1;i<=n;i++)
        if(!ids[i]) dfs(i);

    ofstream o("ctc.out");
    o<<ctc<<endl;
    for(i=1;i<=ctc;i++){
        for(j=0;j<cc[i].size();j++)
            o<<cc[i][j]<<" ";
        o<<endl;
    }
    o.close();
}