from collections import Counter

n, m = map(int, input().split())
A = list(map(int, input().split()))
counter = Counter(A)
d = len(counter)

max_val = min(d, n)

if (m - d) >= n:
    min_val = 0
else:
    k = n - (m - d)
    t = sum(1 for x in counter if counter[x] == n)
    s = d - t  # number of unique elements with count[x] < n
    required = max(0, k - s)
    min_val = required

print(max_val, min_val)