#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin ("retele.in");
ofstream fout ("retele.out");

struct elem {
    int nod;
    int poz;
}g[50010];

int viz[100010],v[100010],p,i,r,j,nr,ok,n,m,x,k,y;

vector<int> a[100010],b[100010],c[100010];

int cmd (elem a, elem b) {
    if(a.nod<b.nod)
        return 1;
    else return 0;
}

void dfs1 (int nod) {
    viz[nod]=1;
    for(int i=0;i<a[nod].size();i++)
        if(viz[a[nod][i]]==0)
           dfs1(a[nod][i]);
    v[++k]=nod;
}

void dfs2 (int nod) {
    viz[nod]=0;
    c[p].push_back(nod);
    if(c[p].size()==1)
        g[++r]={c[p][0],p};
    for(int i=0;i<b[nod].size();i++)
        if(viz[b[nod][i]]==1)
            dfs2(b[nod][i]);
}

int main () {
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y;
        a[x].push_back(y);
        b[y].push_back(x);
    }
    for(i=1;i<=n;i++)
        if(viz[i]==0)
            dfs1(i);
    sort(c+1,c+r+1,cmd);
    while(k>0){
        if(viz[v[k]]==1)
            p++,dfs2(v[k]);
        k--;
    }
    fout<<p<<"\n";
    for(i=1;i<=p;i++){
        sort(c[g[i].poz].begin(),c[g[i].poz].begin()+c[g[i].poz].size());
        for(j=0;j<c[g[i].poz].size();j++)
            fout<<c[g[i].poz][j]<<" ";
        fout<<"\n";
    }
}