#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define INF (1 << 27)
#define EPS 0.00000000001
using namespace std;
vector <int> g[1000];
bool visited[1000];
void addEdge(int a,int b){
    g[a].push_back(b);
    //g[b].pb(a);
}
bool checkLink(int s,int t){
    for(int i=0;i<2000;i++) visited[i] = false;
    visited[s] = true;
    queue<int> q;
    q.push(s);
    while(!q.empty()){
        s = q.front();
        q.pop();
        for(int i=0;i<g[s].size();i++){
            if(g[s][i] == t) return true;
            if(!visited[g[s][i]]){
                visited[g[s][i]] = true;
                q.push(g[s][i]);
            }
        }
    }
    return false;
}
bool checkLinkDfs(int s,int t){
    for(int i=0;i<2000;i++) visited[i] = false;
    visited[s] = true;
    stack<int> q;
    q.push(s);
    while(!q.empty()){
        s = q.top();
        q.pop();
        for(int i=0;i<g[s].size();i++){
            if(g[s][i] == t) return true;
            if(!visited[g[s][i]]){
                visited[g[s][i]] = true;
                q.push(g[s][i]);
            }
        }
    }
    return false;
}
int N;
stack<int> res;
void topSort(int s) {
    visited[s] = true;
    for(int i=0;i<g[s].size();i++){
        if(!visited[g[s][i]])
            topSort(g[s][i]);
    }
    res.push(s);
}
void topologicalSort(){
    for(int i=0;i<N;i++)
        if(!visited[i]) topSort(i);

}
vector<int> gr[1000];
void printGraph(){
    for(int i=0;i<N;i++)
        for(int j=0;j<g[i].size();j++){
            cout<<g[i][j]<<" ";
            cout<<endl;
            }
}
void printGraph2(){
    for(int i=0;i<N;i++)
        for(int j=0;j<gr[i].size();j++){
            cout<<gr[i][j]<<" ";
            cout<<endl;
            }
}
void reverseGraph(){
    for(int i=0;i<N;i++)
        for(int j=0;j<g[i].size();j++)
            gr[g[i][j]].pb(i);

}
int maxNodes = 0;
int tempNodes = 0;
void DFS(int s){
    visited[s] = true;
    tempNodes++;
    for(int i=0;i<gr[s].size();i++)
        if(!visited[gr[s][i]])
            DFS(gr[s][i]);
}
void reset(){
    for(int i=0;i<N;i++)
        visited[i] = false;
}
int components = 0;
void SCC(){
    reset();
    topologicalSort();
    reverseGraph();
    reset();
    while(!res.empty()){
        res.pop();
        int temp = res.top();
        if(!visited[temp]){
            components++;
            DFS(temp);
            cout<<temp<<endl;
            maxNodes = max(maxNodes,tempNodes);
            tempNodes = 0;
        }
    }
}
int main(){
    cin >> N;
    int m;
    cin >> m;
    for(int i=0;i<m;i++){
        int a,b;
        cin >> a >> b;
        //if(!checkLinkDfs(a,b))
            addEdge(a,b);
       // else cout << a << "," << b << endl;
    }
   //topologicalSort();
    SCC();
    cout << components << endl << maxNodes;
return 0;
}