#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define Nmax 100002
using namespace std;
int n, m, i, j, d[Nmax], c, scc[Nmax];
vector < int > V[Nmax], C[Nmax];
bool viz[Nmax], st[Nmax];

void read()
{
    int x, y;
    freopen("ctc.in", "r", stdin);
    freopen("ctc.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for (i = 1; i <= m; ++ i)
    {
        scanf("%d %d", &x, &y);
        V[x].push_back(y);
    }
}
int dfs(int x, int depth)
{
    int i, l = V[x].size();
    d[x] = depth;
    scc[++ scc[0]] = x;
    st[x] = 1;

    for (i = 0; i < l; ++ i)
        if (!viz[V[x][i]])
        {
            viz[V[x][i]] = 1;
            d[x] = min(d[x], dfs(V[x][i], depth + 1));
        }
        else if (st[V[x][i]])
            d[x] = min(d[x], d[V[x][i]]);

    if (d[x] == depth)
    {
        while (scc[0] > 0)
        {
            C[c].push_back(scc[scc[0]]);
            st[scc[scc[0]]] = 0;
            if (scc[scc[0]] == x)
            {
                -- scc[0];
                break;
            }
            -- scc[0];
        }
        ++ c;
    }
    return d[x];
}
void solve()
{
    for (i = 1; i <= n; ++ i)
        if (!viz[i])
        {
            viz[i] = 1;
            d[i] = dfs(i, i);
        }
}
void write()
{
    int l;
    printf("%d\n", c);
    for (i = 0; i < c; ++ i)
    {
        l = C[i].size();
        for (j = 0; j < l; ++ j)
            printf("%d ", C[i][j]);
        printf("\n");
    }
}
int main()
{
    read();
    solve();
    write();
    return 0;
}