#include<bits/stdc++.h>
#define Withers using
#define AK namespace
#define IOI std
Withers AK IOI;typedef long long ll;typedef pair<int,int>pii;
#define infll 0x3f3f3f3f3f3f3f3f
#define inf 0x3f3f3f3f
#define endl '\n'
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define deb(x)cout<<#x<<"="<<x<<" ";
#define pb push_back
#define fi first
#define se second
#define mx3(a,b,c)((a>b?a:b)>c?(a>b?a:b):c)
#define mn3(a,b,c)((a<b?a:b)<c?(a<b?a:b):c)
#define mem(a,b)memset(a,b,sizeof(a))
#define rep(i,a,b)for(int i=a;i<=b;i++)
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];
}

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;
}

void solve()
{
	//do something
	cin>>n>>m;
	n--;
	for(int i = 1; i <= m; i++) cin>>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;
}
void multi()
{
	//rd(tst);
	int tst=1;
	while(tst--)
	{
		solve();
	}
//	pcc();
}
signed main()
{
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	multi();
}
// POWERED BY WITHERS
// THINK ONCE, CODE TWICE
/*things to check
1.  int overflow or long long memory need
2.  recursion/array/binary search/dp/loop bounds
3.  precision
4.  special cases(n=1,bounds)
5.  delete debug statements
6.  initialize(especially multi-tests)
7.  = or == , n or m ,++ or -- , i or j , > or >= , < or <= , - or =
8.  keep it simple and stupid
9.  do not delete, use // instead
10. operator priority
11. is there anything extra to output?
12. if you don't know where the bug is , try to clear some parts of the code
 and check each part seperately.
13. ...
*/
 
/* something to think about
1. greedy? dp? searching? dp with matrix/ segment tree? binary search?
2. If contains "not", why not 正难则反 or few affect?
*/
// lgvc bilibilitdasc zxx zy graygoo tt cyx wsc akioi!