#include<fstream>
#include<vector>
#include<sstream>

using namespace std;
ostringstream sout;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
vector <int> v[100001];
vector <int> vt[100001];
int n, m, i, j, nr, viz[100001], postord[100001], nrc;

void dfst(int nod){
    viz[nod] = 0; int i; sout << nod << " ";
    for (i = 0; i < vt[nod].size(); i++)
        if (viz[vt[nod][i]] == 1)
            dfst(vt[nod][i]);
}

void dfs(int nod){
    viz[nod] = 1; int i; //fout << nod << " ";
    for (i = 0; i < v[nod].size(); i++)
        if (viz[v[nod][i]] == 0)
            dfs(v[nod][i]);
    postord[++nr] = nod;
}

void citire(){
    int i, a, b;
    fin >> n >> m;
    for (i = 1; i <= m; i++){
        fin >> a >> b;
        v[a].push_back(b);
        vt[b].push_back(a);
    }
}

int main(){
    citire();
    for (i = 1; i <= n; i++)
        if (viz[i] == 0)
            dfs(i); //dfs pe graf, am aflat postordinea
    for (i = n; i >= 1; i--) //invers postordine
        if (viz[postord[i]]){
            ++nrc;
            dfst(postord[i]);
            sout << '\n';
        }
    fout << nrc << '\n';
    fout << sout.str();
    fin.close();
    fout.close();
}