#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t=1;
    //cin>>t;
    rep(i,0,t) solve();
}

void solve(){
    int N,M;
    cin>>N>>M;
    if(M==0){
        cout<<N<<" "<<M<<endl;
        return;
    }
    vector<int> U(M),V(M),use(M),g_ind(N);
    struct edge{
        int to;
        int ind;
    };
    vector<vector<edge>> G(N);
    rep(i,0,M){
        cin>>U[i]>>V[i];
        U[i]--,V[i]--;
        G[U[i]].push_back({V[i],i});
    }
    stack<edge> st;
    vector<int> p(N);
    rep(i,0,N){
        st.push({i,-1});
        p[i]=1;
        while(!st.empty()){
            //cout<<st.top().ind<<" "<<st.top().to<<endl;
            int a=st.top().to;
            if((int)G[a].size()==g_ind[a]){
                st.pop();
                p[a]=0;
                continue;
            }
            edge tmp=G[a][g_ind[a]];
            g_ind[a]++;
            if(use[tmp.ind]) continue;
            if(p[tmp.to]){
                use[tmp.ind]=1;
                while(st.top().to!=tmp.to){
                    //vec_out(use);
                    use[st.top().ind]=1;
                    p[st.top().to]=0;
                    st.pop();
                }
                //vec_out(use);
            }
            else st.push(tmp),p[a]=1;
        }
    }
    cout<<N<<" "<<M-vec_sum(use)<<"\n";
    rep(i,0,M) if(use[i]==0) cout<<U[i]+1<<" "<<V[i]+1<<"\n";
}