#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;

ifstream f ("ctc.in");
ofstream g ("ctc.out");

const int SIZE = 100005;

int n, m, id, cnt;
int ids[SIZE], low[SIZE];

bool inStack[SIZE];

vector <int> adj[SIZE], ssc[SIZE];

stack <int> s;

void Read()
{
    f >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x, y;
        f >> x >> y;
        adj[x].push_back(y);
    }
}

void Tarjan(int node)
{
    s.push(node);
    inStack[node] = true;
    ids[node] = low[node] = ++id;

    for (unsigned int i = 0; i < adj[node].size(); i++)
    {
        int neighbour = adj[node][i];
        if (ids[neighbour] == 0)
        {
            Tarjan(neighbour);
        }
        if (inStack[neighbour] == true)
        {
            low[node] = min(low[node], low[neighbour]);
        }
    }

    if (ids[node] == low[node])
    {
        cnt++;
        int temp = 0;

        while (temp != node)
        {
            temp = s.top();
            s.pop();
            inStack[temp] = false;
            ssc[cnt].push_back(temp);
        }
    }
}

void Solve()
{
    for (int i = 1; i <= n; i++)
    {
        if (ids[i] == 0)
        {
            Tarjan(i);
        }
    }
}

void Print()
{
    g << cnt << "\n";
    for (int i = 1; i <= n; i++)
    {
        for (unsigned int j = 0; j < ssc[i].size(); j++)
        {
            g << ssc[i][j] << " ";
        }
        g << "\n";
    }
}

int main()
{
    Read();
    Solve();
    Print();

    return 0;
}