#include<bits/stdc++.h>
#ifndef LOCAL
#include "gap.h"
#endif
#define ll long long
using namespace std;
#ifdef LOCAL
static void my_assert(int k){ if (!k) exit(1); }
static int subtask_num, N;
static long long A[100001];
static long long call_count;
void MinMax(long long s, long long t, long long *mn, long long *mx)
{
int lo = 1, hi = N, left = N+1, right = 0;
my_assert(s <= t && mn != NULL && mx != NULL);
while (lo <= hi){
int mid = (lo+hi)>>1;
if (A[mid] >= s) hi = mid - 1, left = mid;
else lo = mid + 1;
}
lo = 1, hi = N;
while (lo <= hi){
int mid = (lo+hi)>>1;
if (A[mid] <= t) lo = mid + 1, right = mid;
else hi = mid - 1;
}
if (left > right) *mn = *mx = -1;
else{
*mn = A[left];
*mx = A[right];
}
if (subtask_num == 1) call_count++;
else if (subtask_num == 2) call_count += right-left+2;
}
#endif // LOCAL
set<int> st;
const ll INF = 1e18;
mt19937_64 rnd(51);
void solve(ll l, ll r) {
if (l > r) {
return;
}
ll len = r - l + 1;
ll mid = l + rnd() % len, mn, mx;
if (rnd() % 2) {
MinMax(mid, r, &mn, &mx);
if (mn != -1) {
st.insert(mn);
st.insert(mx);
solve(mn + 1, mx - 1);
}
solve(l, mid - 1);
} else {
MinMax(l, mid, &mn, &mx);
if (mn != -1) {
st.insert(mn);
st.insert(mx);
solve(mn + 1, mx - 1);
}
solve(mid + 1, r);
}
}
long long findGap(int t, int n) {
solve(0, INF);
ll last = -1, res = 0;
for (auto to : st) {
if (last != -1) {
res = max(res, abs(last - to));
}
last = to;
}
return res;
}
#ifdef LOCAL
int main()
{
FILE *in = stdin, *out = stdout;
my_assert(2 == fscanf(in, "%d%d", &subtask_num, &N));
my_assert(1 <= subtask_num && subtask_num <= 2);
my_assert(2 <= N && N <= 100000);
for (int i=1;i<=N;i++) my_assert(1 == fscanf(in, "%lld", A+i));
for (int i=1;i<N;i++) my_assert(A[i] < A[i+1]);
fprintf(out, "%lld\n", findGap(subtask_num, N));
fprintf(out, "%lld\n", call_count);
}
#endif
