#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
int main(){
    ll n,m;cin >> n >> m;
    vvl g(n);
    rep(i,m){
        ll a,b;cin >> a >> b;a--;b--;
        g[a].emplace_back(b);
    }
    vl itr(n);//今何番目のedgeを見ているか？
    vl vis(n);//
    auto dfs=[&](auto &self,ll v) -> ll {
        vis[v]=1;
        for(ll &i=itr[v];i<g[v].size();i++){
            ll to=g[v][i];
            if(vis[to]==1){
                g[v][i]=-1;
                i++;
                vis[v]=0;
                return to;
            }
            auto f=self(self,to);
            if(f>=0){
                g[v][i]=-1;
                if(f!=v){
                    vis[v]=0;
                    i++;
                    return f;
                }
            }
            i++;
        }
        vis[v]=0;
        return -1;
    };
    rep(i,n)dfs(dfs,i);
    vpl ans;
    rep(i,n){
        for(auto p:g[i]){
            if(p==-1)continue;
            ans.emplace_back(i,p);
        }
    }
    cout << n <<" " << ans.size() << endl;
    for(auto p:ans)cout << p.first+1 <<" " << p.second+1 << endl;

}