#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 vis[NMax];
vector<int> v[NMax],rev[NMax],comp[NMax];
stack<int> st;

void build(int);
void dfs(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 (vis[i]) {
            continue;
        }

        build(i);
    }

    for (int i=1;i <= N;++i) {
        vis[i] = false;
    }

    while (st.size()) {
        int node = st.top();
        st.pop();

        if (vis[node]) {
            continue;
        }

        ++nrComp;
        dfs(node);
    }


    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 build(int node) {
    vis[node] = true;

    for (int nxt : v[node]) {
        if (vis[nxt]) {
            continue;
        }

        build(nxt);
    }

    st.push(node);
}

void dfs(int node) {
    vis[node] = true;
    comp[nrComp].pb(node);

    for (int nxt : rev[node]) {
        if (vis[nxt]) {
            continue;
        }

        dfs(nxt);
    }
}