#include <bits/stdc++.h>
using namespace std;

void fileIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

using pii = pair<int, int>;
const int N = 3e5 + 10;

int n, m, vis[N], dep[N];
vector<int> g[N], stk;

set<pii> s;

void dfs(int u) {
    vis[u] = 1;
    stk.push_back(u);
    for(int v : g[u]) {
        if(!vis[v]) {
            dep[v] = dep[u] + 1;
            dfs(v);
        }else if(vis[u] == 1 && vis[v] == 1 && stk.size() > dep[u] - dep[v] && stk[stk.size() + dep[v] - dep[u] - 1] == v) {
            s.erase({u, v});
            while(stk.back() != v) {
                int x = stk.back();
                vis[stk.back()] = -1;
                stk.pop_back();
                s.erase({stk.back(), x});
            }
        }
    }
    if(stk.back() == u) {
        vis[u] = -1;
        stk.pop_back();
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> m;
    for(int i = 1, u, v; i <= m; i ++) {
        cin >> u >> v;
        g[u].push_back(v);
        s.insert({u, v});
    }

    for(int i = 1; i <= n; i ++)
        if(!vis[i])
            dfs(i);

    cout << n << " " << s.size() << '\n';
    for(auto &[u, v] : s)
        cout << u << " " << v << "\n";
    return 0;
}