#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int L,N;
int p[5005];
int mint,maxt;
int main()
{
	scanf("%d",&L);
	scanf("%d",&N);
	for(int i=1;i<=N;i++)
	{
		cin>>p[i];
		mint=max(min(p[i],L+1-p[i]),mint);
		maxt=max(max(p[N],L+1-p[i]),maxt);
	}
	printf("%d %d",mint,maxt);
	return 0;
}