#include<bits/stdc++.h>
using namespace std;
const int N=5005;
int a[N];
int main (){
	int l,n;
	cin>>l>>n;
	if(!n){
		cout<<"0 "<<"0"<<endl;
		return 0;
		
	}
	for(int i=1;i<=n;i++)cin>>a[i];
	sort (a+1,a+n+1);
	int maxn,minn;
	for(int i=1;i<=n;i++){
		maxn=max(l-a[1],a[n]);
		minn=max(min(a[i],l-a[i]+1),minn);
	}
	cout<<minn<<' '<<maxn<<endl;
	return 0;
}