#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#include <bitset>
#define INF 0x3f3f3f3f
using namespace std;

ifstream is("ctc.in");
ofstream os("ctc.out");

using VI = vector<int>;
using VVI = vector<VI>;
using VP = vector<pair<int, int>>;
using VPP = vector<pair<int, pair<int, int>>>;

int n, m;
VI nv, nm, c;
VVI g, ctc;
stack<int> s;
bitset<100001> ok;

void Read();
void Write();
void Solve(int nod, int niv);

int main()
{
    Read();
    nm = nv = VI(n + 1);
    for ( int i = 1; i <= n; ++i )
        if ( !nv[i] )
            Solve(i, 1);
    Write();
    is.close();
    os.close();
    return 0;
}

void Solve(int nod, int niv)
{
    nv[nod] = nm[nod] = niv;
    s.push(nod);
    ok[nod] = 1;
    for ( const auto &nodv : g[nod] )
        if ( !nv[nodv] )
        {
            Solve(nodv, niv + 1);
            if ( ok[nodv] )
                nm[nod] = min(nm[nod], nm[nodv]);
        }
        else
            if ( ok[nodv] )
                nm[nod] = min(nm[nod], nm[nodv]);
    if ( nv[nod] == nm[nod] )
    {
        c.clear();
        int nod2 = 0;
        while ( nod2 != nod )
        {
            c.push_back(nod2 = s.top());
            s.pop();
            ok[nod2] = 0;
        }
        ctc.push_back(c);
    }
}

void Read()
{
    is >> n >> m;
    g = VVI(n + 1);
    int x, y;
    while ( m-- )
    {
        is >> x >> y;
        g[x].push_back(y);
    }
}

void Write()
{
    os << ctc.size() << "\n";
    for ( const auto &i : ctc )
    {
        for ( const auto &j : i )
            os << j << " ";
        os << "\n";
    }
}