def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil,pi,factorial,gcd,atan,degrees,sqrt
    from operator import itemgetter
    def I(): return int(input())
    def MI(): return map(int, input().split())
    def LI(): return list(map(int, input().split()))
    def SI(): return input().rstrip()
    def printns(x): print('\n'.join(x))
    def printni(x): print('\n'.join(list(map(str,x))))
    def myceil(a,b):
        return (-(-a//b))
    inf = 10**17
    mod = 10**9 + 7
    #mod =998244353

    n,m = MI()
    lis = LI()
    lis = list(set(lis))
    x = len(lis)
    if x==1 and m==n:
        print(x,1)
    else:
        print(x,0)



        
if __name__=="__main__":
    main()