/*
请问如何想到从小到大插入。
*/
#include<bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
unordered_map<int,pair<int,int> >mp;
//用 map 维护出现情况，优先队列维护转移顺序
priority_queue<int,vector<int>,greater<int> >q;
int n,m;
int d[35];
int a[35];
int calc(int j){
	//计算 j 点被交换的次数
//	for(int i = 0;i<n;i++)cout << a[i] << " ";cout << endl;
	int pos = j,ans = 0;
	for(int i = 1;i<=m;i++){
		int tt = 0,c = 0,st = pos%d[i];
		/*
		for(int j =0;j<d[i];j++){
			for(int k =j;k<n;k+=d[i]){
				for(int l = k;l!=j and a[l]>a[l-d[i]];l-=d[i]){
					swap(a[l],a[l-d[i]]);
					if(a[l]==0 or a[l-d[i]]==0)++ans;
				}
			}
		}
		*/
		for(int j =0;j<d[i];j++){
			if(j == st)continue;
		//	cout << "  " << j << endl;
			int tt =0,c = 0;
			int now = j;
			while(now<n){tt += (a[now]==1);now+=d[i];}
			now = j;
			while(now<n){
				++c;
				if(c<=tt)a[now] = 1;
				else a[now] = -1;
				now += d[i];
			}
		}
		for(int j = st;j<n;j+=d[i]){
		//	cout << j << " " << a[j] << " " << pos << endl;
			if(a[j]==1){
				++tt;
				ans+=(j>pos);
			}
			if(a[j]==-1){
				ans+=(j<pos);
			}
		}
		//cout << ans << endl;
		while(st<n){
			++c;
			if(c <= tt)a[st] = 1;
			else{
				if(c == tt+1)a[st] = 0,pos = st;
				else a[st] = -1;
			}	
			st += d[i];
		}
	//	for(int i =0;i<n;i++)cout << " " << a[i];cout << endl;
		
	}
//	for(int i =0;i<n;i++)cout << a[i] << " ";cout << endl;
	for(int i =1;i<n;i++)assert(a[i]<=a[i-1]);
//	cout << ans << endl;
	return ans;
}
signed main(){
	cin >> n >> m;
	for(int i = 1;i<=m;i++)cin >> d[i];
	for(int i = 0;i<d[1];i++){
		int cc = 0;
		for(int j =0;j<n;j++)a[j] = 1;a[i] = 0;
		mp[(1<<i)] = {calc(i),1};
		q.push(1<<i);
	}
	while(!q.empty()){
		auto e = q.top();q.pop();
		int S = e;auto ee = mp[S];int mx = ee.first,cnt = ee.second;
//		cout << " " << S << " " << mx << " " << cnt << endl;
		for(int i =0;i<d[1];i++){
			for(int j = i;j<n;j+=d[1]){
				if(!(S>>j&1)){
	//				cout << j << endl;
					//往 j 里塞 i
					for(int i = 0;i<n;i++){
						if(S>>i&1)a[i] = -1;
						else a[i] = 1;
					}
					a[j] = 0;
					int to = S|(1<<j),mmx = mx+calc(j);
					if(!mp.count(to)){
						q.push(to);
						mp[to] = {mmx,cnt};
					}else{
						auto e = mp[to];
						if(e.first == mmx){
							e.second = (e.second+cnt);
							if(e.second>=mod)e.second-=mod;
						}else if(e.first < mmx){
							e.first = mmx,e.second = cnt;
						}
						mp[to] = e;
					}
					break;
				}
			}
		}
	}
	int tt =0 ;
	for(int i =0;i<d[1];i++){
		int cc =0 ;
		for(int j = i;j<n;j+=d[1])cc++;
		tt = tt+cc*(cc-1)/2;
	}
	auto e = mp[(1<<n)-1];
	int mx = e.first,cnt = e.second;
	cout << mx/2 << " " << cnt << endl;
}/*
30 9
10 9 8 7 6 5 4 3 1
*/