#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=35;
const int mod=1e9+7;
int n,m;
int d[N];
unordered_map<int,int> ma;
vector<int> z;
vector<int> f,g;
vector<int> si;
void dfs(int no,int id){
    for(int x=0;x<d[1];++x){
        int y=x;
        while(y<n&&no&(1<<y))y+=d[1];
        if(y>=n)continue;
        if(ma[no|(1<<y)]==0){
            z.push_back(no|(1<<y));
            ma[no|(1<<y)]=z.size()-1;
            dfs(no|(1<<y),z.size()-1);
        }
    }
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=m;++i){
        cin>>d[i];
    }
    z.push_back(0);
    dfs(0,0);
    sort(z.begin(),z.end());
    for(int i=0;i<z.size();++i){
        ma[z[i]]=i;
    }
    f.resize(z.size());
    g.resize(z.size());
    f[0]=(n/d[1]-1)*(n/d[1])/2*(d[1]-n%d[1])+(n/d[1])*(n/d[1]+1)/2*(n%d[1]);
    g[0]=1;
    for(int ii=0;ii<z.size();++ii){
        int k=z[ii];
        for(int x=0;x<d[1];++x){
            int y=x;
            while(y<n&&k&(1<<y))y+=d[1];
            if(y>=n)continue;
            int nf=f[ii],ng=g[ii];
            int kk=k|(1<<y),to=y;
            for(int i=2;i<=m;++i){
                si.clear();
                si.resize(d[i]);
                for(int j=0;j<n;++j){
                    if(j==to){
                        nf+=(j/d[i])-si[j%d[i]];
                    }
                    if(kk&(1<<j))si[j%d[i]]++;
                }
                to=(si[to%d[i]]-1)*d[i]+(to%d[i]);
                kk=0;
                for(int j=0;j<d[i];++j){
                    for(int t=0;t<si[j];++t){
                        kk+=(1<<(t*d[i]+j));
                    }
                }
            }
            int tid=ma[k|(1<<y)];
            if(f[tid]<nf){
                f[tid]=nf;
                g[tid]=0;
            }
            if(f[tid]==nf)g[tid]=(g[tid]+ng)%mod;
        }
    }
    cout<<f[ma[(1<<n)-1]]<<' '<<g[ma[(1<<n)-1]];
    //while(1);
    return 0;
}