import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N, M;
int[] A, B;

int[][] G;
bool[] del;
bool[] vis;

// returns vertex at found cycle
int dfs(int u) {
  debug {
    writeln("dfs ", u);
  }
  if (vis[u]) {
    return u;
  }
  vis[u] = true;
  for (; !G[u].empty; ) {
    const i = G[u].back;
    G[u].popBack;
    debug {
      writeln("  ", A[i], " -> ", B[i]);
    }
    const res = dfs(B[i]);
    if (~res) {
      del[i] = true;
      if (res != u) {
        vis[u] = false;
        return res;
      }
    }
  }
  vis[u] = false;
  return -1;
}

void main() {
  try {
    for (; ; ) {
      N = readInt;
      M = readInt;
      A = new int[M];
      B = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt - 1;
        B[i] = readInt - 1;
      }
      
      G = new int[][N];
      foreach (i; 0 .. M) {
        G[A[i]] ~= i;
      }
      del = new bool[M];
      vis = new bool[N];
      foreach (u; 0 .. N) {
        dfs(u);
      }
      debug {
        writeln("G = ", G);
      }
      
      writeln(N, " ", del.count(false));
      foreach (i; 0 .. M) if (!del[i]) {
        writeln(A[i] + 1, " ", B[i] + 1);
      }
      stderr.writeln("========");
    }
  } catch (EOFException e) {
  }
}