#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, m; cin >> n >> m;
  vector<vector<int>> graph(n);
  while (m--) {
    int u, v; cin >> u >> v; --u; --v;
    graph[u].emplace_back(v);
  }
  vector<int> is_visited(n, false), cycle;
  vector<pair<int, int>> ans;
  REP(s, n) {
    is_visited[s] = true;
    cycle.emplace_back(s);
    while (!cycle.empty()) {
      if (graph[cycle.back()].empty()) {
        if (cycle.size() >= 2) ans.emplace_back(cycle.end()[-2], cycle.back());
        is_visited[cycle.back()] = false;
        cycle.pop_back();
      } else {
        const int to = graph[cycle.back()].back();
        graph[cycle.back()].pop_back();
        if (is_visited[to]) {
          while (cycle.back() != to) {
            is_visited[cycle.back()] = false;
            cycle.pop_back();
          }
        } else {
          is_visited[to] = true;
          cycle.emplace_back(to);
        }
      }
    }
  }
  cout << n << ' ' << ans.size() << '\n';
  for (const auto& [u, v] : ans) cout << u + 1 << ' ' << v + 1 << '\n';
  return 0;
}