#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
int n, m, cnt, s, x, y, p, d[15];
unordered_map <int, pair <int, int>> f;
bitset <30> o, a;
void solve()
{
	o = a; cnt = s = 0; p = y;
	for (int i = 1; i <= m; i++)
    {
		for (int j = p; j < n; j += d[i]) s += !o[j];
		cnt += s; s = 0;
		for (int j = 0; j < d[i]; s = 0, j++)
        {
			for (int k = j; k < n; k += d[i]) s += !o[k];
			if (p % d[i] == j) p = s * d[i] + j;
			for (int k = j, l = 0; k < n; k += d[i], l++) o[k] = (s <= l);
		}
	}
	if (f[x].fi < f[x^1<<y].fi + cnt) f[x] = {f[x^1<<y].fi + cnt, 0};
	if (f[x].fi == f[x^1<<y].fi + cnt) f[x].se += f[x^1<<y].se;
}
void work(int S) {for (y = 0; y < n; y++) if (a[y] && !a[y+d[1]]) x = S, solve();}
void dfs(int p, int S) 
{
	if (p == n) return work(S); a[p] = 0; dfs(p + 1, S);
	if (p < d[1] || a[p-d[1]]) a[p] = 1, dfs(p + 1, S | 1 << p);
}
int main()
{
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> m;
    for (int i = 1; i <= m; i++) cin >> d[i];
	f[0] = {0, 1}; dfs(0, 0);
	cout << f[(1<<n)-1].fi << " " << f[(1<<n)-1].se;
	return 0;
}