import sys

sys.setrecursionlimit(300005)
# 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):
    vis[u]=1
    for v,i in to[u]:
        if seen[i]:continue
        seen[i]=1
        if vis[v]==2:continue
        if vis[v]==1:
            vis[u]=0
            dead[i]=1
            return v
        r=dfs(v)
        if r==u:
            dead[i]=1
        elif r!=-1:
            dead[i]=1
            vis[u]=0
            return r
    vis[u]=2
    return -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
seen=[0]*m
vis=[0]*n
for u in range(n):
    if vis[u]:continue
    dfs(u)

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