#include<bits/stdc++.h>
using namespace std;
const int MAXN = 5e3 + 5;
int L, N, maxn = 0, minn = 5e3, nxt, ans;
const int MID = L / 2;
int a[MAXN];
int main()
{
	//freopen(".in", "r", stdin);
	//freopen(".out", "w", stdout);
	scanf("%d%d", &L, &N);
	for(int i = 1; i <= N; i ++)
	{
		ans = 0;
		scanf("%d", &a[i]);
		if(a[i] >= MID)
		{
			nxt = a[i];
			while(nxt <= L)
			{
				nxt ++;
				ans ++;
			}
		}
		else if(a[i] < MID)
		{
			nxt = a[i];
			while(nxt > 0)
			{
				nxt --;
				ans ++;
			}
		}
		minn = min(minn, ans);
		ans = 0;
		if(a[i] >= MID)
		{
			nxt = a[i];
			while(nxt > 0)
			{
				nxt --;
				ans ++;
			}
		}
		else if(a[i] < MID)
		{
			nxt = a[i];
			while(nxt <= L)
			{
				nxt ++;
				ans ++;
			}
		}
		maxn = max(maxn, ans);
	}
	printf("%d %d", minn, maxn);
	return 0;
}