#include<iostream>
#include<string>
#include<cstring>
#include<math.h>
#include<algorithm>
using namespace std;

int l, n, s[5005];

int main()
{
	cin >> l >> n;
	if (n == 0)
	{
		cout << "0 0"; return 0;
	}
	double k = (l + 1) / 2.0;
	for (int i = 1; i <= n; i++)cin >> s[i];
	sort(s + 1, s + n + 1);
	if (n == 1)
	{
		if (n < k)cout << s[1] << " " << l + 1 - s[1];
		else cout << l + 1 - s[1] << " " << s[1];
	}
	else
	{
		double minn = 6000; 
        int maxn = 0;
		for (int i = 1; i <= n; i++)
		{
			minn = min(minn, abs(s[i] - k));
		}
		maxn = max(l + 1 - s[1], s[n]);
		cout << k - minn << " " << maxn;
	}
	return 0;
}