#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize(3)
#define DB double
#define LL long long
#define ULL unsigned long long
#define in128 __int128
#define cint const int
#define cLL const LL
#define For(z,e1,e2) for(int z=(e1);z<=(e2);z++)
#define Rof(z,e1,e2) for(int z=(e2);z>=(e1);z--)
#define For_(z,e1,e2) for(int z=(e1);z<(e2);z++)
#define Rof_(z,e1,e2) for(int z=(e2);z>(e1);z--)
#define inint(e) scanf("%d",&e)
#define inll(e) scanf("%lld",&e)
#define inpr(e1,e2) scanf("%d%d",&e1,&e2)
#define in3(e1,e2,e3) scanf("%d%d%d",&e1,&e2,&e3)
#define outint(e) printf("%d\n",e)
#define outint_(e) printf("%d%c",e," \n"[i==n])
#define outint2_(e,e1,e2) printf("%d%c",e," \n"[(e1)==(e2)])
#define outll(e) printf("%lld\n",e)
#define outll_(e) printf("%lld%c",e," \n"[i==n])
#define outll2_(e,e1,e2) printf("%lld%c",e," \n"[(e1)==(e2)])
#define exc(e) if(e) continue
#define stop(e) if(e) break
#define ret(e) if(e) return
#define ll(e) (1ll*(e))
#define pb push_back
#define ft first
#define sc second
#define clean(e) while(!e.empty()) e.pop()
#define all(ev) ev.begin(),ev.end()
#define sz(ev) ((int)ev.size())
#define debug(x) printf("%s=%d\n",#x,x)
#define x0 _x0_
#define y1 _y1_
#define ffo fflush(stdout)
cLL mod=998244353,G=404;
template <typename Type> void get_min(Type &w1,const Type w2) { if(w2<w1) w1=w2; }
template <typename Type> void get_max(Type &w1,const Type w2) { if(w2>w1) w1=w2; }
template <typename Type> Type up_div(Type w1,Type w2) { return (w1/w2+(w1%w2?1:0)); }
template <typename Type> Type gcd(Type X_,Type Y_) { Type R_=X_%Y_; while(R_) { X_=Y_; Y_=R_; R_=X_%Y_; } return Y_; }
template <typename Type> Type lcm(Type X_,Type Y_) { return (X_/gcd(X_,Y_)*Y_); }
template <typename Type> Type md(Type w1,const Type w2=mod) { w1%=w2; if(w1<0) w1+=w2; return w1; }
template <typename Type> Type md_(Type w1,const Type w2=mod) { w1%=w2; if(w1<=0) w1+=w2; return w1; }
void ex_gcd(LL &X_,LL &Y_,LL A_,LL B_)
{ if(!B_) { X_=1ll; Y_=0ll; return ; } ex_gcd(Y_,X_,B_,A_%B_); X_=md(X_,B_); Y_=(1ll-X_*A_)/B_; }
LL inv(LL A_,LL B_=mod) { LL X_=0ll,Y_=0ll; ex_gcd(X_,Y_,A_,B_); return X_; }
template <typename Type> void add(Type &w1,const Type w2,const Type M_=mod) { w1=md(w1+w2,M_); }
void mul(LL &w1,cLL w2,cLL M_=mod) { w1=md(w1*md(w2,M_),M_); }
template <typename Type> Type pw(Type X_,Type Y_,Type M_=mod) { Type S_=1; while(Y_) { if(Y_&1) mul(S_,X_,M_); Y_>>=1; mul(X_,X_,M_); } return S_; }
cint N=32,N_=30,M=12,P=7.02e6;
int n,m,m_,p;
int a[M];
vector <int> v;
#define ar array <int,N_>
vector <ar> g; 
bool b[N];
void dfs(int f,int k)
{
    if(k>=n) return (void)(v.pb(f));
    if(k<a[m_]||(k>=a[m_]&&b[k-a[m_]])) b[k]=true,dfs(f|(1<<k),k+1);
    b[k]=false,dfs(f,k+1);
}
void dfs2(int f,int k)
{
    if(k>=n) return (void)(v.pb(f));
    if(k<a[m_]||(k>=a[m_]&&!b[k-a[m_]])) b[k]=false,dfs2(f,k+1);
    b[k]=true,dfs2(f|(1<<k),k+1);
}
int c[N],mx[N];
unordered_map <int,ar> fun,fun2;
ar work(int w,int k)
{
    if(k>m)
    {
        ar t;
        For_(i,0,n) t[i]=0;
        return (fun[w]=t);
    }
    int w2=w;
    For_(i,0,n)
    {
        exc(!(w2>>i&1));
        int i2=i;
        while(i2>=a[k]&&!(w2>>(i2-a[k])&1))
        {
            w2^=(1<<i2-a[k])|(1<<i2);
            i2-=a[k];
        }
    }
    ar t;
    auto t2=fun2[k==m?0:w2];
    int cnt=0;
    For_(i,0,n) c[i]=((w>>i&1)?i+1:0),t[i]=0;
    For(i,0,n-1)
    {
        for(int i2=i;i2>=a[k];i2-=a[k])
        {
            if(c[i2]>c[i2-a[k]])
            {
                if(!c[i2-a[k]]) t[c[i2]-1]++;
                swap(c[i2],c[i2-a[k]]);
            }
            else break;
        }
    }
    For_(i,0,a[k]) mx[i]=0;
    For_(i,0,n) if(c[i]) mx[i%a[k]]=t2[i];
    For_(i,0,n) if(c[i]) t[c[i]-1]+=mx[i%a[k]];
    return (fun[w]=t);
}
int f[P],dp[P];
unordered_map <int,int> mp;
void main_solve()
{
    inpr(n,m);
    For(i,1,m) inint(a[i]);
    for(m_=m;m_>=1;m_--)
    {
        fun2.clear();
        swap(fun,fun2);
        v.clear();
        dfs(0,0);
        sort(all(v));
        // printf("m_=%d\n",m_);
        // for(auto i:v) printf("%d ",i);
        // printf("\n");
        for(auto i:v) work(i,m_+1);
    }
    fun2.clear();
    swap(fun,fun2);
    v.clear();
    m_=1;
    dfs2(0,0);
    sort(all(v));
    for(auto i:v) g.pb(work(i,1));
    p=0; for(auto i:v) mp[i]=p++;
    memset(f,0xc0,p*sizeof(int));
    memset(dp,0,p*sizeof(int));
    f[0]=0,dp[0]=1;
    For_(i,0,p)
    {
        int t=v[i];
        For_(j,0,n)
        {
            exc((t>>j&1)||mp.find(t|(1<<j))==mp.end());
            int i2=mp[t|(1<<j)];
            int c=f[i]+g[i2][j];
            exc(c<f[i2]);
            if(c==f[i2]) add(dp[i2],dp[i]);
            else dp[i2]=dp[i];
            f[i2]=c;
        }
    }
    /*For_(i,0,p)
    {
        For_(j,0,n) printf("%d",v[i]>>j&1);
        printf(": %d %d\n> ",f[i],dp[i]);
        for(auto j:g[i]) printf("%d ",j);
        printf("\n");
    }*/
    printf("%d %d\n",f[p-1],dp[p-1]);
}
int main()
{
    // ios::sync_with_stdio(0); cin.tie(0);
    // freopen("in.txt","r",stdin);
    // freopen("out1.txt","w",stdout);
    // rsand(time(NULL));
    // main_init();
    // int _; inint(_); For(__,1,_) // T>1 ?
        // printf("\n------------\n\n"),
        main_solve();
    return 0;
}
/*
2 2 2 1 1
*/