#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

const int NMAX = 100000;

int index = 1;

vector <int> v[NMAX+5];
int idx[NMAX+5], low[NMAX+5];
bool in_stack[NMAX+5];

int s[NMAX+5], Size;

vector <int> ans[NMAX+5];
int comp;

void tarjan(int nod)
{
    idx[nod] = index++;
    low[nod] = idx[nod];
    in_stack[nod] = true;
    s[Size++] = nod;
    for(int i=0; i<v[nod].size(); i++)
    {
        int New = v[nod][i];
        if(idx[New] == 0)
        {
            tarjan(New);
            low[nod] = min(low[nod], low[New]);
        }
        else if(in_stack[New])
        {
            low[nod] = min(low[nod], idx[New]);
        }
    }
    if(idx[nod] == low[nod])
    {
        do
        {
            Size--;
            in_stack[s[Size]] = false;
            ans[comp].push_back(s[Size]);
        }
        while(Size > 0 && s[Size]!=nod);
        comp++;
    }
}

int main()
{
    freopen("ctc.in", "r", stdin);
    freopen("ctc.out", "w", stdout);
    int n, m;
    scanf("%d%d", &n, &m);
    for(int i=0; i<m; i++)
    {
        int x, y;
        scanf("%d%d", &x, &y);
        v[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
        if(idx[i] == 0) tarjan(i);
    printf("%d\n", comp);
    for(int i=0; i<comp; i++)
    {
        for(auto x : ans[i]) printf("%d ", x);
        printf("\n");
    }
    return 0;
}