#include <stdio.h>
#include <stdlib.h>
void MinMax(long long, long long, long long*, long long*);
#ifndef MUAATH_5
#include "gap.h"
#endif
#include <bits/stdc++.h>
#define ll long long
using namespace std;
// 22, 6 floor()22/6
// X...#...#....#....#....X
long long findGap(int T, int N)
{
const ll n = N;
ll mn, mx;
MinMax(0, 1e18, &mn, &mx);
const ll blk = (mx-mn-1)/(n-1) + 1;
ll sol = blk;
if (T == 1) {
for (int i = 1; i < n; i++) {
ll L=-1, R=-1;
MinMax(mn+1, mx, &L, &R);
sol = max(sol, L - mn);
mn = L;
}
return sol;
}
// cerr << blk << endl;
vector<pair<ll, ll>> v;
ll i = 1;
for (; mn+i*blk-1 <= mx+blk-2; i++) {
ll lmn=-1, lmx=-1;
const ll L = mn + (i-1)*(blk), R = mn+i*blk-1;
MinMax(L, R, &lmn, &lmx);
if (lmn != -1) {
if (v.size())
sol = max(sol, lmn - v.back().second);
v.push_back({lmn, lmx});
}
}
sol = max(sol, mx - v.back().second);
return sol;
}
#ifdef MUAATH_5
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;
long long findGap(int, int);
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;
}
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
