#include <bits/stdc++.h>
using namespace std;
int32_t main()
{
int n,q;
cin >> n >> q;
vector<int> ar(n);
for(int i = 0; i < n;i++)
cin >> ar[i];
int mx = 0;
for(int i = 0; i < n-1;i++){
mx = max(mx,abs(ar[i]-ar[i+1]));
}
cout << mx << ' ';
if(q == 1)
{
long long cur = 0, ans = 0;
for(int i = 0; i < n-1;i++){
if(abs(ar[i] - ar[i+1]) == mx)
{
if(cur > 0)
{
if(ar[i+1] - ar[i] == ar[i] - ar[i-1])
cur++;
else
{
ans += (cur+1)*(cur)/2;
cur = 1;
}
}
else
cur++;
}
else if(cur > 0)
{
ans += (cur+1)*(cur)/2;
cur = 0;
}
}
if(cur > 0)
ans += (cur+1)*(cur)/2;
cout << ans;
}
}
