#include <bits/stdc++.h>

using namespace std;

const int maxn = 100000, maxm = 200000;

int N, M;
vector <int> v[maxn + 1], inv[maxn + 1];
bool viz[maxn + 1];
vector <int> sorttop;

inline int read()  {
    int x = 0;
    char ch = getchar();
    while(!isdigit(ch))
        ch = getchar();
    while(isdigit(ch))
        x = x * 10 + ch - '0', ch = getchar();
    return x;
}

void dfs(int nod)  {
    if(viz[nod])
        return;
    viz[nod] = 1;
    for(auto &x : v[nod])  {
        dfs(x);
    }
    sorttop.push_back(nod);
}

int curr;
vector <int> ans[maxn + 1];

void dfsinv(int nod)  {
    if(!viz[nod])
        return;
    viz[nod] = 0;
    for(auto &x : v[nod])  {
        dfsinv(x);
    }
    ans[curr].push_back(nod);
}

int main()  {
    freopen("ctc.in", "r", stdin);
    freopen("ctc.out", "w", stdout);
    N = read(), M = read();
    for(int i = 0;i < M;i++)  {
        int x, y;
        x = read(), y = read();
        v[x].push_back(y);
        inv[y].push_back(x);
    }
    for(int i = 1;i <= N;i++)//sortarea topologica
        dfs(i);
    for(auto &x : sorttop)  {
        if(viz[x])  {
            dfsinv(x);
            curr++;
        }
    }
    cout << curr << "\n";
    for(unsigned int i = 0;i < curr;i++)  {
        for(unsigned int j = 0;j < ans[i].size();j++)
            cout << ans[i][j] << " ";
        cout << "\n";
    }
    return 0;
}