#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define LL long long
#define PII pair<int, int>

const int N = 35, M = 15, mod = 1e9 + 7;
int n, m, d[M], ss[M][M];
PII ans;

inline void add(PII &a, PII b)
{
	if(a.first < b.first) a = b;
	else if(a.first == b.first) (a.second += b.second) >= mod && (a.second -= mod);
}

unordered_map<int, int> to[N];
int get(int x, int s)
{
	if(to[x].count(s)) return to[x][s];
	
	to[x][s] = 0;
	for(int i = 0; i < d[x]; i++)
	{
		int t = __builtin_popcount(s & ss[x][i]);
		if(t) to[x][s] |= ss[x][i] & (1 << (t - 1) * d[x] + i + 1) - 1;
	}
	return to[x][s];
}

//第x轮考虑y的贡献，结束时比a[y]小的集合为s
int dfs(int x, int y, int s)
{
	if(x == m) return 0;
	
	int y1 = __builtin_popcount(s & ss[x + 1][y % d[x + 1]]) * d[x + 1] + y % d[x + 1],
		cnt = y / d[x + 1] - __builtin_popcount(s & ss[x + 1][y % d[x + 1]] & (1 << y) - 1);
	return dfs(x + 1, y1, get(x + 1, s)) + cnt;
}

unordered_map<int, PII> g;
PII dp(int s)
{ 
	if(s == 0) return {0, 1};
	if(g.count(s)) return g[s];
	
	PII v = {0, 0};
	for(int i = 0; i <= n; i++)
		if(s >> i & 1 && (LL)s >> i + d[1] & 1 ^ 1)
		{
			PII t = dp(s ^ 1 << i);
			add(v, {t.first + dfs(1, i, s ^ 1 << i), t.second});
		}
	return g[s] = v;
}

int main()
{
	cin >> n >> m;
	n--;
	for(int i = 1; i <= m; i++) scanf("%d", &d[i]);
	reverse(d + 1, d + m + 1);
	while(d[m] > n) m--;
	reverse(d + 1, d + m + 1);
	for(int i = 1; i <= m; i++)
		for(int j = 0; j < d[i]; j++)
			for(int k = j; k <= n; k += d[i])
				ss[i][j] |= 1 << k;
	
	int res = 0;
	for(int i = 0; i < d[1]; i++) 
	{
		int t = (n - i) / d[1] + 1;
		res += t * (t - 1) / 2;
	}
	ans = dp((1 << n + 1) - 1);
	cout << ans.first + res << " " << ans.second << endl;
	return 0;
}