#include <bitset>
#include <fstream>
#include <vector>
#include <stack>

#define NMAX 100005

using namespace std;

vector<int> G[NMAX];
vector<vector<int>> sol;
bool inStack[NMAX];
stack<int> st;
int n,m,lev;
int comp[NMAX], level[NMAX];

void dfs(int nod)
{
    ++ lev;
    level[nod] = lev;
    comp[nod] = lev;
    st.push(nod);
    inStack[nod] = 1;
    for (int it : G[nod])
        if (!comp[it])
            dfs(it), level[nod] = min(level[nod], level[it]);
        else if (inStack[it])
            level[nod] = min(level[nod], level[it]);
    if (comp[nod] == level[nod])
    {
        vector<int> lsol;
        int cnod;
        do
        {
            cnod = st.top();
            st.pop();
            lsol.push_back(cnod);
        }
        while (cnod != nod);
        sol.push_back(lsol);
    }
}


int main()
{
    ifstream fin("ctc.in");
    fin >> n >> m;
    int x, y;
    for (int i = 0; i<m; i++)
    {
        fin >> x >> y;
        G[x].push_back(y);
    }
    fin.close();
    
    for (int i = 1; i <= n; i++)
        if (!comp[i]) dfs(i);
    
    ofstream fout("ctc.out");
    fout << sol.size() << endl;
    for (int i = 0; i < sol.size(); i++)
    {
        for (int nod : sol[i])
            fout << nod << " ";
        fout << endl;
    }
    fout.close();
    
    return 0;
}