n,q = map(int,input().split())
ar = list(map(int,input().split()))
ans = 0
for i in range(n-1):
mx = max(ar[i],ar[i+1])
mn = min(ar[i],ar[i+1])
ans = max(ans,(mx-mn))
print(ans,end = ' ')
cur = 0;
cnt = 0;
for i in range(n-1):
if(abs(ar[i] - ar[i+1]) == ans):
if(cur >= 1):
if(ar[i] - ar[i+1] == ar[i-1] - ar[i]):
cur+=1
else:
cnt += cur * (cur+1) / 2
cur = 1
else:
cur+=1
elif cur > 0:
cnt += cur * (cur+1)/2
cur = 0;
if(cur > 0):
cnt += cur * (cur+1)/2
if(q == 1):
print(cnt)
