luogu智商堪忧

#pseudocode 士兵位置减去最大值加一和0去取min 和 max
w = int(input())
q = int(input())

if q > 0:
    l = list(map(int, input().split()))
    h = w / 2
    low = 0
    high = 0

    for i in l:
        if i > h:
            low = max(low, (w + 1) - i)
            high = max(high, i)
        else:
            low = max(low, i)
            high = max(high, (w + 1) - i)
    print(low, high)
else:
    print(0, 0)