#include <cstdio>
#include <map>
using namespace std;
const int mod = 1000000007;
int n,m,d[10],f[1048576],g[1048576],tot[11],base[10],a[10],tmp,tmp2,val[2200000],rod[2200000],nxt[2200000],st[2200000],stc,stc2;
char cst[30][2200000],tp[30][2200000];
short cost[30][2200000];
map <pair <int,int>,int> mp;
void dfs(int v,int r){
	mp[make_pair(v,r)] = stc;
    val[stc] = v;
    rod[stc] = r;
	if(r == m){
		for(int i = 0;i < n;i++){
            cst[i][stc] = tp[i][stc] = cost[i][stc] = -1;
		}
		nxt[stc] = -1;
		return;
	}
	int to = 0,cnt,cnt2;
	for(int i = 0;i < d[r];i++){
		cnt = cnt2 = 0;
		for(int j = i;j < n;j += d[r]){
			cnt += !((v >> j) & 1);
		}
		for(int j = i,k = 1;j < n;j += d[r],k++){
			to |= (k > cnt) << j;
			cnt2 += !((v >> j) & 1);
            cst[j][stc] = cnt - cnt2;
            tp[j][stc] = i + (cnt - 1) * d[r];
            cost[j][stc] = -1;
		}
	}
	if(mp.find(make_pair(to,r + 1)) == mp.end()){
        nxt[stc] = stc + 1;
        stc++;
		dfs(to,r + 1);
	}
	else{
        nxt[stc] = mp[make_pair(to,r + 1)];
	}
}
void dfs2(int v,int r){
	if(r == d[0]){
        st[++stc2] = ++stc;
		dfs(v,0);
		return;
	}
	dfs2(v,r + 1);
	for(int i = r;i < n;i += d[0]){
		v |= 1 << i;
		dfs2(v,r + 1);
	}
}
void dfs3(int v,int r){
	if(rod[v] == m){
		cost[r][v] = 0;
		return;
	}
	if(cost[tp[r][v]][nxt[v]] < 0){
		dfs3(nxt[v],tp[r][v]);
	}
	cost[r][v] = cost[tp[r][v]][nxt[v]] + cst[r][v];
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i = 0;i < m;i++){
		scanf("%d",&d[i]);
	}
	dfs2(0,0);
	for(int i = 1;i <= stc2;i++){
		for(int j = 0;j < n;j++){
			if(!((val[st[i]] >> j) & 1)){
				dfs3(st[i],j);
			}
		}
	}
	tot[0] = g[0] = 1;
	for(int i = 0;i < d[0];i++){
		base[i] = n / d[0] + (i + n / d[0] * d[0] < n) + 1;
		tot[i + 1] = tot[i] * base[i];
	}
	for(int i = 0;i < tot[d[0]];i++){
		tmp = i;
		tmp2 = 0;
		for(int j = 0;j < d[0];j++){
			a[j] = tmp % base[j];
			tmp /= base[j];
			for(int k = j,l = 1;k < n;k += d[0],l++){
				if(l <= a[j]){
					tmp2 += 1 << k;
				}
			}
		}
		tmp2 = mp[make_pair(tmp2,0)];
		for(int j = 0;j < d[0];j++){
			if(a[j] < base[j] - 1 && f[i] + cost[j + a[j] * d[0]][tmp2] > f[i + tot[j]]){
				f[i + tot[j]] = f[i] + cost[j + a[j] * d[0]][tmp2];
				g[i + tot[j]] = g[i];
			}
			else if(a[j] < base[j] - 1 && f[i] + cost[j + a[j] * d[0]][tmp2] == f[i + tot[j]]){
				g[i + tot[j]] = (g[i + tot[j]] + g[i]) % mod;
			}
		}
	}
	printf("%d %d",f[tot[d[0]] - 1],g[tot[d[0]] - 1]);
	return 0;
}