#include<vector>
#include<iostream>
#include<map>
#include<cstring>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#define ll int
#define mod 1000000007
using namespace std;
inline ll add(ll x){return x>=mod?x-mod:x;}
inline pair<ll,ll> operator+(const pair<ll,ll> &a,const ll &b){return make_pair(a.first+b,a.second);}
inline pair<ll,ll> operator+(const pair<ll,ll> &a,const pair<ll,ll> &b){
    if(a.first==b.first) return make_pair(a.first,add(a.second+b.second));
    else if(a.first<b.first) return b;
    else return a;
}
vector<ll> pos[15],emp;
ll n,m,i,j,k,d[15],full;
ll vis[2000005];
pair<ll,ll> maps[2000005];
vector<bool> vis2[15][35];
vector<ll> maps2[15][35];
ll prod[15][35][15],wz[15][35][15],cntt[15][15],f[35][15];
inline void write(pair<ll,ll> a){cout<<a.first<<" "<<a.second<<endl;}
ll t,cnts[15];
inline ll get(ll step,ll zero,ll idd,ll pos){
    ll ff = f[pos][step];
    if(ff==f[zero][step]){
        if(pos==zero) return 0;
        if(pos<zero) return -1;
        return 1;
    }
    if(pos/d[step]+1+(idd/prod[step][zero][ff])%(wz[step][zero][ff])<=cntt[step][ff]) return -1;
    return 1;
}
inline void work(ll Step,ll Zero,ll Idd,ll &swap_count,ll &zero,ll &idd2,ll step) {
    zero = t-1;
    for (ll i = 0; i < t; i++) {
        ll temp = 0,endid = -1;
        cnts[i] = 0;
        for (ll j = i; j < n; j += t){
            ll now = get(Step,Zero,Idd,j);
            endid = j;
            if(now == 0) temp = 1;
            if(now == 1) cnts[i]++;
            if(now == -1) swap_count += temp;
        }
        if(temp) zero=endid-t*cnts[i];
        else idd2+=prod[step][zero][i]*cnts[i];
    }
}
inline ll dfs2(ll step,ll zero,ll idd){
    if(vis2[step-1][zero][idd]) return maps2[step-1][zero][idd];
    if(step>m) return 0;
    ll ans = 0,zero2 = -1,idd2 = 0;
    t = d[step];
    work(step-1,zero,idd,ans,zero2,idd2,step);
    ans += dfs2(step+1,zero2,idd2);
    return vis2[step-1][zero][idd] = 1,maps2[step-1][zero][idd] = ans;
}
ll bin[15];
inline pair<ll,ll> dfs(ll id){
    if(id==full-1) return make_pair(0,1);
    if(vis[id]) return maps[id];
    pair<ll,ll> ans = make_pair(-1,0);
    for(ll i=0;i<emp.size();i++){
        if(emp[i]<pos[i].size()){
            ll idd = 0;
            for(ll j=0;j<emp.size();j++) if(j!=i) idd+=prod[1][pos[i][emp[i]]][j]*(pos[j].size()-emp[j]);
            emp[i]++;
            ans = (ans+(dfs(id+bin[i])+dfs2(2,pos[i][emp[i]-1],idd)+(pos[i].size()-emp[i])));
            emp[i]--;
        }
    }
    return vis[id]=1,maps[id]=ans;
}
ll cnt[15];
int main(){
    ios::sync_with_stdio(0);
    cin>>n>>m;
    for(i=1;i<=m;i++) cin>>d[i];
    memset(cnt,0,sizeof(cnt));
    for(j=0;j<n;j++) cnt[j%d[1]]++;
    ll noww = 1;
    for(j=0;j<d[1];j++) bin[j]=noww,noww*=(cnt[j]+1);
    full=noww;
    for(i=1;i<=m;i++){
        memset(cnt,0,sizeof(cnt));
        for(j=0;j<n;j++) cnt[j%d[i]]++,f[j][i]=j%d[i];
        for(j=0;j<d[i];j++) cntt[i][j]=cnt[j];
        for(j=0;j<n;j++){
            memset(cnt,0,sizeof(cnt));
            for(k=0;k<n;k++){
                if(k%d[i]==j%d[i]) continue;
                cnt[k%d[i]]++;
            }
            ll now=1;
            for(k=0;k<d[i];k++) prod[i][j][k]=now,now*=(cnt[k]+1),wz[i][j][k]=cnt[k]+1;
            vis2[i][j].resize(now),maps2[i][j].resize(now);
        }
    }
    for(i=0;i<n;i++) pos[i%d[1]].push_back(i);
    for(i=0;i<d[1];i++) emp.push_back(0);
    write(dfs(0));
    return 0;
}