#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<=(b);++i) 
#define dec(i,a,b) for(int i=(a);i>=(b);--i) 
using ll=long long;
using pi=pair<int,int>;
using vi=vector<int>;
using vp=vector<pi>;
template<class T> bool chkmin(T &x,T y) {return (y<x)?(x=y,true):false;}
template<class T> bool chkmax(T &x,T y) {return (y>x)?(x=y,true):false;}
#define pb push_back
#define SZ(x) int(x.size())
#define fi first
#define se second
#define LOCAL 0
#define open_file if(LOCAL) {freopen("b.in","r",stdin);freopen("b.out","w",stdout);}
#define Bit(i) (1<<(i))
#define bit(s,i) (((s)>>(i))&1)
int read() {int x;scanf("%d",&x);return x;}
const int MAXN=30;
const int mod=1e9+7;
#define look_time cerr<<(1.0*clock()/CLOCKS_PER_SEC)<<"\n";
void add(int &x,int T) {x+=T;if(x>=mod) x-=mod;}
using info=pi;
void operator +=(info &x,const info &y) {
    if(y.fi>x.fi) x=y;
    else if(y.fi==x.fi) add(x.se,y.se);
}
info operator +(info x,const int &k) {
    x.fi+=k;return x;
}

int n,m,D;
int stp[15];
namespace shell_sort {
    int A[35];int len,t;
    int swap_count;
    void work() {
        rep(pos,t,len-1) for(int j=pos;j>=t&&A[j]<A[j-t];j-=t) swap(A[j],A[j-t]),swap_count+=(A[j]==1);
    }
    int sh(int bs,int sp) {
        rep(i,0,n-1) A[i]=bit(bs,i)<<1;A[sp]=1;
        len=n,swap_count=0;
        dec(i,m,1) {
            t = stp[i];
            work();
        }
        return swap_count;
    }
};
using shell_sort::sh;
void show(pi nw) {
    rep(i,0,n-1) if(i==nw.se) putchar('*');
    else putchar('0'+bit(nw.fi,i));
    puts("");
}

vector<pair<pi,int>> tr;
void dfs(int rem,int bs) {
    if(rem==D) {
        rep(pos,0,n-1) if(!bit(bs,pos)&&(pos+D>=n||bit(bs,pos+D))) tr.pb({pi(bs,pos),sh(bs,pos)});
        return ;
    }
    int num=(n-1-rem)/D;// pos::[0,num]*D+rem
    rep(ps,0,num+1) {
        int nxt=bs;
        rep(i,ps,num) nxt|=Bit(rem+i*D);
        dfs(rem+1,nxt);
    }
}
void get_base() {dfs(0,0);}

unordered_map<int,info> dp;
int c2(int x) {return x*(x-1)/2;}
void solve() {
    n=read(),m=read();
    dec(i,m,1) scanf("%d",stp+i);
    D=stp[m--];
    tr.reserve(8e6);
    get_base();look_time
    
    dp[0]={0,1};//!!
    sort(tr.begin(),tr.end());
    for(auto &[bs,delt]:tr) {
        dp[bs.fi|Bit(bs.se)]+=(dp[bs.fi]+delt);
    }
    pi ans=dp[Bit(n)-1];
    rep(rem,0,D-1) ans.fi+=c2((n-1-rem)/D+1);//!
    printf("%d %d\n",ans.fi,ans.se);
}
int main() {
    open_file
    for(int test_case=1;test_case;test_case--) solve();
    look_time
    return 0;
}