#include <fstream>
#include <vector>
#include <stack>
#include <iostream>
using namespace std;

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

vector<int> graf[100005];
int n, m;
vector<vector<int> > totSol;
bool viz[100005], inStack[100005];
int low[100005];
stack<int> S;

void citire()
{
    f>>n>>m;
    int x, y;
    for(int i = 0; i<m; i++)
    {
        f>>x>>y;
        graf[x].push_back(y);
    }
}

void dfs(int currNode, int niv)
{
    viz[currNode] = true;
    S.push(currNode);
    inStack[currNode] = true;
    low[currNode] = niv;
    for(int i : graf[currNode])
    {
        if(!viz[i])
        {
            dfs(i, niv+1);
        }
        if(inStack[i])
            low[currNode] = min(low[i], low[currNode]);
    }
    if(low[currNode] == niv)
    {
        vector<int> sol;
        do
        {
            sol.push_back(S.top());
            inStack[S.top()] = false;
            S.pop();
        }while(S.top() != currNode);
        totSol.push_back(sol);
    }
}

void parcurgere()
{
    for(int i = 1; i<=n; ++i)
    {
        if(!viz[i])
            dfs(i, 0);
    }
}

void afisare()
{
    g<<totSol.size()<<"\n";
    for(int i = 0; i<totSol.size(); i++)
    {
        for(int j : totSol[i])
        {
            g<<j<<" ";
        }
        g<<"\n";
    }
}

int main()
{
    citire();
    parcurgere();
    afisare();
    return 0;
}