#include<bits/stdc++.h>
using namespace std;
int n,m,d[15];
unordered_map<int,pair<int,int>>f;
bool v[45],vis[45];
void solve(int i,int j){
    for(int i=0;i<n;i++)v[i]=vis[i];
    int tot=0,s,x=j,I=i;
    for(int i=1;i<=m;i++){
        s=0;
        for(int j=x;j<n;j+=d[i])s+=(v[j]==0);
        tot+=s;
        for(int j=0;j<d[i];j++){
            s=0;
            for(int k=j;k<n;k+=d[i])s+=(v[k]==0);
            if(j==x%d[i])x=s*d[i]+x%d[i];
            for(int k=j,l=0;k<n;k+=d[i],l++)v[k]=(s<=l);
        }
    }
    if(f[i].first<f[i^1<<j].first+tot)f[i]={f[i^1<<j].first+tot,0};
    if(f[i].first==f[i^1<<j].first+tot)f[i].second+=f[i^1<<j].second;
}
void Solve(int i){
	if(i==0)return;
	for(int j=0;j<n;j++)
		if(vis[j]&&!vis[j+d[1]])solve(i,j);
}
void dfs(int D,int I){
	if(D==n)return Solve(I);
	vis[D]=0,dfs(D+1,I);
	if(D<d[1]||vis[D-d[1]])vis[D]=1,dfs(D+1,I^1<<D);
}
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].first<<" "<<f[(1<<n)-1].second<<'\n';
    return 0;
}