#include <bits/stdc++.h>
using namespace std;
int main()
{
	int s,n;
	int mi=0,mi2=0,mx=0,mx2=0;
	
	cin >> s>>n;
	int a[n+2];
	if( n == 0)
	cout << 0 << " " << 0;
	else {
		for (int i = 1; i <= n; i++)
		{
			cin >> a[i];
			mi2 = min(a[i], s - a[i] + 1);
			mi = max(mi, mi2);
			mx = max(a[i], s - a[i] + 1);
			mx2 = max(mx, mx2);
		}

		cout << mi << " " << mx2;
}
	return 0;
}

简单的不能再简单了，
3-31是我第一道A的红题，
而4-8号我就A了这道题，
比我A的第一道橙题还早