#include <iostream>
#include <fstream>
#include <stack>
#include <vector>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <stack>

using namespace std;
ifstream in("ctc.in");
ofstream out("ctc.out");

#define ll long long
#define pb push_back
const int inf = 1e9 + 5;
const int NMax = 1e5 + 5;

int N,M,nrComp;
bool pls[NMax],mns[NMax];
vector<int> v[NMax],rev[NMax],comp[NMax];
stack<int> st;

void dfs1(int);
void dfs2(int);

int main() {
    in>>N>>M;
    while (M--) {
        int x,y;
        in>>x>>y;

        v[x].pb(y);
        rev[y].pb(x);
    }

    for (int i=1;i <= N;++i) {
        if (mns[i]) {
            continue;
        }

        ++nrComp;
        dfs1(i);
        dfs2(i);

        while (st.size()) {
            int node = st.top();
            st.pop();
            pls[node] = false;
        }
    }

    out<<nrComp<<'\n';
    for (int i=1;i <= nrComp;++i) {
        for (int e : comp[i]) {
            out<<e<<' ';
        }
        out<<'\n';
    }

    in.close();
    out.close();
    return 0;
}

void dfs1(int node) {
    pls[node] = true;
    st.push(node);

    for (int nxt : v[node]) {
        if (mns[nxt] || pls[nxt]) {
            continue;
        }

        dfs1(nxt);
    }
}

void dfs2(int node) {
    mns[node] = true;
    comp[nrComp].pb(node);

    for (int nxt : rev[node]) {
        if (mns[nxt] || !pls[nxt]) {
            continue;
        }

        dfs2(nxt);
    }
}