#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;
#define maxn 100001

int used[maxn],st[maxn];
vector <int> g[maxn];
vector <int> gt[maxn];
vector <int> ctc[maxn];

int sol=0;

inline void dfs(int nod)
{
    used[nod]=1;
    int i;
    for (i=0; i< g[nod].size() ; i++)
        if (!used[ g[nod][i] ])
        {
            dfs(g[nod][i]);
        }
    st[++st[0]]=nod;
}

inline void dfst(int nod)
{
    used[nod]=1;
    int i;
    for (i=0;i<gt[nod].size();i++)
        if (! used[ gt[nod][i] ])
        {
            dfst(gt[nod][i]);
        }
    ctc[sol].push_back(nod);
}

int main()
{
    freopen("ctc.in","r",stdin);
    freopen("ctc.out","w",stdout);
    int i,n,m,x,y;
    scanf("%d %d",&n,&m);
    for (i=1;i<=m;i++)
    {
        scanf("%d %d",&x,&y);
        g[x].push_back(y);
        gt[y].push_back(x);
    }
    memset(used,0,sizeof(used));
    memset(st,0,sizeof(st));
    for (i=1;i<=n;i++)
        if (!used[i]) dfs(i);
    memset(used,0,sizeof(used));
    for (i=n;i>0;i--)
        if (!used[st[i]])
        {
            sol++;
            dfst(st[i]);
        }
    printf("%d\n",sol);
    int j;
    for (i=1;i<=sol;i++)
    {
        for (j=0;j<ctc[i].size();j++)
            printf("%d ",ctc[i][j]);
        printf("\n");
    }
    return 0;
}