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

const int maxim = 100002;
int n, m, intersectie[maxim], vizitate[maxim], parcurse[maxim];
vector<int> a[maxim], transpus[maxim];
vector<vector<int>> solutie;

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

void citireOrientat(){
    int x, y;
    in >> n >> m;
    for(int i = 1; i <= m; i++){
        in >> x >> y;
        a[x].push_back(y);
        transpus[y].push_back(x); //formez graful transpus
    }
}

void dfs(int x, vector<int> graf[maxim]){
    vizitate[x] = 1;
    for(auto j: graf[x])
        if(vizitate[j] == 0)
            dfs(j, graf);
}
//
//void dfsTranspus(int x){
//    vizitate[x] = 1;
//    for(auto j: transpus[x])
//        if(vizitate[j] == 0)
//            dfsTranspus(j);
//}

int main(){
    citireOrientat();
    vector<int> ctcActual;
    for(int i = 1; i <= n; i++){
        if(parcurse[i] == 0){
            dfs(i, a);
            parcurse[i] = 1;
            for(int x = 1; x <= n; x++){
                intersectie[x] += vizitate[x];
                vizitate[x] = 0;
            }
            dfs(i, transpus);
            for(int x = 1; x <= n; x++){
                intersectie[x] += vizitate[x];
                vizitate[x] = 0;
            }
            for(int x = 1; x <= n; x++){
                if(intersectie[x] == 2){
                    ctcActual.push_back(x);
                    parcurse[x] = 1;
                }
                intersectie[x] = 0;
            }
            if(ctcActual.empty() == 0)
                solutie.push_back(ctcActual);
            ctcActual.clear();
        }
    }
    out << solutie.size() << "\n";
    for(auto i: solutie){
        for(auto j: i)
            out << j << " ";
        out << "\n";
    }
    return 0;
}