#include<cstdio>
#include<vector>
#include<cstring>
using namespace std;
int n,m,v[100001],viz[100001],viz2[100001],x[100001],nr;
vector <int> l[100001],lt[100001];





void dfs(int u)
{
    vector<int>::iterator it;
    viz[u]=1;
    for(it=l[u].begin();it!=l[u].end();++it)
        if(viz[*it]==0)
            dfs(*it);
    v[++nr]=u;
}



void dfs2(int u)
{
    vector<int>::iterator it;
    viz2[u]=1;
    for(it=lt[u].begin();it!=lt[u].end();++it)
        if(viz2[*it]==0)
            dfs2(*it);
}




int main()
{
    freopen("ctc.in","r",stdin);
    freopen("ctc.out","w",stdout);
    int i,j,u,w,num;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;++i)
    {
        scanf("%d%d",&u,&w);
        l[u].push_back(w);
        lt[w].push_back(u);
    }
    for(i=1;i<=n;++i)
        dfs(i);
    num=0;
    for(i=1;i<=n;++i)
    {
        if(x[v[i]]==0)
        {
            memset(viz,0,sizeof(viz));
            memset(viz2,0,sizeof(viz2));
            dfs(v[i]);
            dfs2(v[i]);
            ++num;
            for(j=1;j<=n;++j)
                if(viz[j]==viz2[j])
                    x[j]=num;
        }
    }
    printf("%d\n",num);
    for(i=1;i<=num;++i)
    {
        for(j=1;j<=n;++j)
            if(x[j]==i)
                printf("%d ",j);
        printf("\n");
    }
    return 0;
}