#include<bits/stdc++.h>
#define bc __builtin_popcount
using namespace std;
const int mod = 1e9 + 7;
int n, m, d[10], f[5000000], g[5000000], t[10][10][31], a[10][10], c[10], b[10], x[10];

signed main()
{
	int i, j, k, st;
	scanf("%d%d", &n, &m);
	for(i=0;i<m;i++) scanf("%d", &d[i]);
	if(m==1) return printf("%d 1", n * (n - 1) / 2), 0;
	for(i=0;i<n;i++) c[i%d[0]]++;
	for(i=0;i<m;i++) for(j=0;j<d[i];j++) for(k=j;k<n;k+=d[i])
		a[i][j]++, t[i][j][a[i][j]] = t[i][j][a[i][j]-1] | (1 << k);
	b[0] = g[0] = 1;
	for(i=1;i<=d[0];i++) b[i] = b[i-1] * (c[i-1] + 1), f[0] += c[i-1] * (c[i-1] - 1) / 2;
	for(st=0;st<b[d[0]];st++)
	{
		int S = 0;
		for(i=0;i<d[0];i++) x[i] = st / b[i] % (c[i] + 1), S |= t[0][i][x[i]];
		for(i=0;i<d[0];i++) if(x[i]!=c[i])
		{
			int now = S, pos = i + x[i] * d[0], sw = 0;
			for(j=1;j<m;j++)
			{
				int p = pos % d[j], nS = 0;
				sw += bc((now&t[j][p][a[j][p]])>>pos);
				pos = p + d[j] * bc(now&t[j][p][a[j][p]]);
				for(k=0;k<d[j];k++) nS |= t[j][k][bc(t[j][k][a[j][k]]&now)];
				now = nS;
			}
			int tt = st + b[i];
			int F = f[st] + sw, G = g[st];
			if(F>f[tt]) f[tt] = F, g[tt] = 0;
			if(F==f[tt]) (g[tt] += G) %= mod;
		}
	}
	printf("%d %d\n", f[b[d[0]]-1], g[b[d[0]]-1]);
	return 0;
}