#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, low[N], dfn[N], dcnt;
vector<int> g[N], stk;

set<pii> s;

void dfs(int u) {
    low[u] = dfn[u] = ++dcnt;
    for(int v : g[u]) {
        if(!dfn[v]) {
            dfs(v);
            if(low[v] <= dfn[u]) s.erase({u, v});
            low[u] = min(low[u], low[v]);
        }
    }
    if(low[u] >= dfn[u]) {
        for(int v : g[u]) {
            low[u] = min(low[u], dfn[v]);
        }
        if(low[u] < dfn[u]) {
            for(int v : g[u]) {
                if(dfn[v] == low[u]) {
                    s.erase({u, v});
                    break;
                }
            }
        }
    }
    dfn[u] = N;
}

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(!dfn[i])
            dfs(i);

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