#include<bits/stdc++.h>
#define N 100010
using namespace std;

int n,m,k,k2;
vector<int>V[N],CTC[N];
int low[N], disc[N], inS[N];
stack<int>S;

void DFS(int x) {
    disc[x]=low[x]=++k;
    S.push(x); inS[x]=1;
    for (auto it:V[x]) {
        if (!disc[it]) {
            DFS(it);
            low[x]=min(low[x], low[it]);
        } else if (inS[it]) {
            low[x]=min(low[x], disc[it]);
        }
    }
    if (low[x]==disc[x]) {
        int v=S.top(); ++k2;
        do {
            v=S.top();
            inS[v]=0; S.pop();
            CTC[k2].push_back(v);
        } while (v!=x);
    }
}

int main() {
    ifstream cin("ctc.in");
    ofstream cout("ctc.out");
    cin>>n>>m;
    for (int i=1; i<=m; ++i) {
        int x,y; cin>>x>>y;
        V[x].push_back(y);
    }
    for (int i=1; i<=n; ++i) {
        if (!disc[i]) {
            DFS(i);
        }
    }
    cout<<k2<<'\n';
    for (int i=1; i<=k2; ++i) {
        for (auto it:CTC[i]) cout<<it<<" "; cout<<'\n';
    }

    return 0;
}