import sys
#sys.setrecursionlimit(10 ** 6)
INF = float('inf')
#10**20,2**63に変えるのもあり
MOD = 10**9 + 7
MOD2 = 998244353
from collections import defaultdict
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(input())
    def IC(): return [int(c) for c in input()]
    def MI(): return map(int, sys.stdin.readline().split())
    N,M = MI()
    A = LI()
    Num = defaultdict(lambda:0)
    for a in A:
        Num[a] += 1
    Key = list(Num.keys())
    Count = len(Key)
    if N ==M and Count == 1:
        print(1,1)
        exit()
    Min = M - Count
    if Min >= 0:
        print(Count,0)
    else:
        print(Count,abs(Min))
    return
solve()