#include<bits/stdc++.h>
using namespace std;
int L,beginnumber,beginsite[100];
int main(){
	cin>>L;
	int number=1;
	cin>>beginnumber;
	int mid=L/2;
	for(int i=0;i<beginnumber;i++){
		cin>>beginsite[i];
	}
	int mintime=0,maxtime=0;
	for(int i=0;i<mid;i++){
		if(beginsite[i]<mid) mintime+=beginsite[i];
		if(beginsite[i]>=mid) mintime+=(L-beginsite[i]);
	}
	//最小值求完了
	for(int i=0;i<L;i++){
		maxtime+=beginsite[i];
	}
	//简单最大值
	cout<<mintime<<' '<<maxtime;
	return 0;
}