#include<bits/stdc++.h>
#define ll long long
#define MAXN (200005)
#define MAXS (200005)
using namespace std;
void File()
{
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
}
template<typename type>
void read(type &x)
{
    bool f=0;char ch=0;x=0;
    while(ch<'0'||ch>'9'){f|=!(ch^'-');ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
    x=f?-x:x;
}
template<typename type,typename... Args>
void read(type &x,Args &... args)
{
    read(x);
    read(args...);
}
struct item{
    int l,r;  
};
inline bool cmp(item x,item y){return (x.l^y.l)?(x.l<y.l):(x.r<y.r);}
int n,s,p,tot,sum;
int w[MAXN],v[MAXN],cnt[MAXS];
ll ans;
vector<item> f[MAXS];
void merge(vector<item> &fy,vector<item> fx,int dt)
{
    vector<item> tmp;
    int pt=0,nl=-1,nr=-1;
    for(item I:fy)
    {
        ans-=I.r-I.l+1;
        while(pt<fx.size()&&fx[pt].l+dt<I.l)
        {
            if((~nr)&&(nr<fx[pt].l+dt))
            {
                tmp.push_back({nl,nr});
                ans+=nr-nl+1,nl=nr=-1;
            }
            if(nr==-1) nl=fx[pt].l+dt,nr=fx[pt].r+dt;
            else if(nr>=fx[pt].l+dt) nr=max(nr,fx[pt].r+dt);
            ++pt;
        }
        if((~nr)&&(nr<I.l))
        {
            tmp.push_back({nl,nr});
            ans+=nr-nl+1,nl=nr=-1;
        }
        if(nr==-1) nl=I.l,nr=I.r;
        else if(nr>=I.l) nr=max(nr,I.r);
    }
    while(pt<fx.size())
    {
        if((~nr)&&(nr<fx[pt].l+dt))
        {
            tmp.push_back({nl,nr});
            ans+=nr-nl+1,nl=nr=-1;
        }
        if(nr==-1) nl=fx[pt].l+dt,nr=fx[pt].r+dt;
        else if(nr>=fx[pt].l+dt) nr=max(nr,fx[pt].r+dt);
        ++pt;
    }
    if(~nr) tmp.push_back({nl,nr}),ans+=nr-nl+1;
    fy.swap(tmp);
}
int main()
{
#ifndef ONLINE_JUDGE
    File();
#endif
    read(n,s);
    for(int i=1,x;i<=n;i++)
    {
        read(x);
        ++cnt[x];
    }
    for(int i=2,c,now;i<=s;i++)
    {
        c=cnt[i],now=1;
        while(c)
        {
            ++tot;w[tot]=now,v[tot]=(i-1)*now;
            if(!(c&1)){++tot;w[tot]=now,v[tot]=(i-1)*now;}
            c=(c-1)>>1,now<<=1;
        }
    }
    ans=1ll*(cnt[0]+1)*(cnt[1]+1);
    for(int i=0;i<=cnt[0];i++) f[n-i].push_back({i,i+cnt[1]});
    sum=n;
    for(int i=1;i<=tot;i++)
    {
        for(int j=sum;j>=n-cnt[0];j--)
            if(!f[j].empty())
                merge(f[j+v[i]],f[j],w[i]);
        sum+=v[i];
    }
    printf("%lld",ans);
}