#ifndef LOCAL
#define FAST_IO
#endif

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using i32 = signed int;
using i64 = signed long long;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

#ifdef INT128

using u128 = __uint128_t;
using i128 = __int128_t;

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64)x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64)x;
    return os;
}

#endif

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void)0
#endif

int main() {
    i32 n, m;
    cin >> n >> m;
    Vec<Vec<pair<i32, i32>>> g(n);
    REP(i, m) {
        i32 u, v;
        cin >> u >> v;
        --u;
        --v;
        g[u].emplace_back(v, i);
    }
    Vec<i32> vis(n, 0);
    Vec<tuple<i32, i32, i32>> edges;
    Vec<tuple<i32, i32, i32>> ans;
    const auto dfs = [&](const auto &dfs, i32 v) -> void {
        vis[v] = 1;
        while (!g[v].empty()) {
            auto [u, e] = g[v].back();
            g[v].pop_back();
            if (!vis[u]) {
                edges.emplace_back(v, u, e);
                dfs(dfs, u);
                if (!vis[v]) {
                    return;
                }
            } else {
                while (get<0>(edges.back()) != u) {
                    auto [a, b, c] = edges.back();
                    edges.pop_back();
                    vis[b] = 0;
                }
                edges.pop_back();
                dfs(dfs, u);
                return;
            }
        }
        if (!edges.empty()) {
            ans.emplace_back(edges.back());
            edges.pop_back();
        }
        vis[v] = 0;
    };
    DBG(g);
    REP(i, n) {
        if (g[i].size()) {
            dfs(dfs, i);
        }
        DBG(g);
    }
    cout << n << ' ' << ans.size() << '\n';
    for (auto [u, v, e] : ans) {
        cout << u + 1 << ' ' << v + 1 << '\n';
    }
}