import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(1000005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = -1-(-1 << 63)
# md = 10**9+7
md = 998244353

def dfs(u):
    uu, ii = [u], []
    vis[u] = 1
    while uu:
        u = uu[-1]
        v = i = -1
        while to[u] and use[i]: v, i = to[u].pop()
        if use[i]:
            vis[u] = 0
            uu.pop()
        elif vis[v]:
            dead[i] = 1
            use[i] = 1
            while uu[-1] != v:
                u = uu.pop()
                vis[u] = 0
                i = ii.pop()
                dead[i] = 1
        else:
            uu.append(v)
            ii.append(i)
            use[i] = 1
            vis[v] = 1

n, m = LI()
to = [[] for _ in range(n)]
uv = []
for i in range(m):
    u, v = LI1()
    to[u].append((v, i))
    uv.append((u+1, v+1))

dead = [0]*m
use = [0]*m+[1]
vis = [0]*n
for u in range(n):
    if not to[u]: continue
    dfs(u)

print(n, m-sum(dead))
for i in range(m):
    if dead[i]: continue
    print(*uv[i])