#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 30
#define M 10
#define K 1048576
#define mod 1000000007
using namespace std;
const int inf=(int)(1e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
struct reads
{
	int num,data;
};
reads dp[K+1];
reads operator + (reads a,reads b)
{
	if (a.num>b.num) swap(a,b);
	if (a.num==b.num) return (reads){a.num,MD(a.data+b.data)};
	else return b;
}
reads F(reads x,int d)
{
	return (reads){x.num+d,x.data};
}
int n,m,d[N+1],cnt[M+1],scnt[M+1],delta[N+1],p[N+1],len,st[N+1];
void get(int x)
{
	for (int i=0;i<d[1];++i) delta[i]=x%(cnt[i]+1),x/=(cnt[i]+1);
	return;
}
int calc()
{
	int res=0,cnt,cnt2,cnt3;
	bool op;
	for (int i=2;i<=m;++i)
		for (int j=0;j<d[i];++j)
		{
			len=cnt=cnt2=cnt3=0,op=1;
			for (int k=j;k<n;k+=d[i]) st[++len]=p[k];
			for (int k=1;k<=len-1;++k) op&=(st[k]<=st[k+1]);
			if (!op)
			{
				for (int k=len;k>=1;--k)
				{
					if (st[k]==0) cnt++;
					else if (st[k]==1) res+=cnt,cnt2++;
					else cnt3++;
				}
				for (int k=j;k<n;k+=d[i])
				{
					if (cnt) p[k]=0,cnt--;
					else if (cnt2) p[k]=1,cnt2--;
					else p[k]=2,cnt3--;
				}
			}
		}
	return res;
}
int main()
{
	int ds,res=0,rst=1;
	n=read(),m=read();
	for (int i=1;i<=m;++i) d[i]=read();
	for (int i=0;i<n;++i) cnt[i%d[1]]++;
	for (int i=0;i<d[1];++i) scnt[i]=cnt[i]+1,rst*=(cnt[i]+1);
	for (int i=1;i<d[1];++i) scnt[i]*=scnt[i-1];
	for (int i=0;i<d[1];++i) scnt[i]/=(cnt[i]+1);
	for (int i=0;i<rst;++i) dp[i]=(reads){-inf,0};
	dp[0]=(reads){0,1};
	for (int i=0;i<rst;++i)
	{
		get(i);
		for (int j=0;j<d[1];++j)
			if (delta[j]+1<=cnt[j])
			{
				for (int k=0;k<n;++k) p[k]=2;
				for (int k=0;k<d[1];++k)
					for (int t=0;t<delta[k];++t)
						p[t*d[1]+k]=0;
				p[delta[j]*d[1]+j]=1,ds=calc(),dp[i+scnt[j]]=dp[i+scnt[j]]+F(dp[i],ds);
	        }
	}
	for (int i=0;i<d[1];++i) res+=((cnt[i]*(cnt[i]-1))>>1);
	printf("%d %d\n",dp[rst-1].num+res,dp[rst-1].data);
	return 0;
}