#include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define N 50005
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
typedef long long ll;
int node,ctc,n,m,x,y,use[2*N];
vector <int> g[2*N],gt[2*N],ans[2*N];
stack <int> s;
void dfs(int nod)
{
    use[nod]=1;
    for(auto it : g[nod])
        if(!use[it])
            dfs(it);
    s.push(nod);
}
void dfs1(int nod)
{
    use[nod]=2;
    ans[ctc].pb(nod);
    for(auto it : gt[nod])
        if(use[it]==1)
            dfs1(it);
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        g[x].pb(y);
        gt[y].pb(x);
    }
    for(int i=1;i<=n;i++)
        if(!use[i])
            dfs(i);
    while(!s.empty())
    {
        node=s.top();
        if(use[node]==1)
        {
            ctc++;
            dfs1(node);
        }
        s.pop();
    }
    fout<<ctc<<'\n';
    for(int i=1;i<=ctc;i++,fout<<'\n')
        for(auto it : ans[i])
            fout<<it<<' ';
    return 0;
}