#include<bits/stdc++.h>
#define ll long long
#define ld double
#define PII pair<int,int>
#define PLI pair<ll,int>
#define fi first
#define se second
using namespace std;
const int N=2e5+5;
int n,m,b[N],tot;
ll ans;
vector<PII>f[N*2],vec;
struct Node{int x,y;}a[N];
void Merge(vector<PII>&F,vector<PII>&G,int x)
{
    int j=0,L=-1,R=-1;
    for(int i=0;i<F.size();i++)
    {
        ans-=F[i].se-F[i].fi+1;
        while(j<G.size()&&G[j].fi+x<F[i].fi)
        {
            if(~R&&R<G[j].fi+x)vec.push_back({L,R}),ans+=R-L+1,L=R=-1;
            if(R<0)L=G[j].fi+x,R=G[j].se+x;
            else if(R>=G[j].fi+x)R=max(R,G[j].se+x);
            ++j;
        }
        if(~R&&R<F[i].fi)vec.push_back({L,R}),ans+=R-L+1,L=R=-1;
        if(R<0)L=F[i].fi,R=F[i].se;
        else if(R>=F[i].fi)R=max(R,F[i].se);
    }
    while(j<G.size())
    {
        if(~R&&R<G[j].fi+x)vec.push_back({L,R}),ans+=R-L+1,L=R=-1;
        if(R<0)L=G[j].fi+x,R=G[j].se+x;
        else if(R>=G[j].fi+x)R=max(R,G[j].se+x);
        ++j;
    }
    if(~R)vec.push_back({L,R}),ans+=R-L+1;
    // printf("Merge:%d\n",x);
    // for(PII p:F)printf("[%d,%d] ",p.fi,p.se);puts("");
    // for(PII p:G)printf("[%d,%d] ",p.fi,p.se);puts("");
    // for(PII p:vec)printf("[%d,%d] ",p.fi,p.se);puts("");
    F=vec;
    vec.clear();
}
int main()
{
	#ifndef ONLINE_JUDGE
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
	#endif
	
    scanf("%d%d",&n,&m);
    for(int i=1,x;i<=n;i++)
    {
        scanf("%d",&x);
        ++b[x];
    }
    for(int i=2;i<=m;i++)
    {
        int x=b[i],y=1;
        while(x)
        {
            a[++tot]={y,(i-1)*y};
            if(x%2==0)a[++tot]={y,(i-1)*y};
            x=(x-1)/2,y<<=1;
        }
    }
    // for(int i=1;i<=tot;i++)printf("%d %d\n",a[i].x,a[i].y);
    ans=(b[0]+1)*(b[1]+1);
    for(int i=0;i<=b[0];i++)f[N-i].push_back({i,i+b[1]});
    int R=N;
    for(int o=1;o<=tot;o++)
    {
        for(int i=R;i>=N-b[0];i--)if(!f[i].empty())
        {
            // printf("Out:%d %d %d\n",i+a[o].y-N,i-N,a[o].x);
            Merge(f[i+a[o].y],f[i],a[o].x);
        }
        R+=a[o].y;
    }
    printf("%lld\n",ans);
    
	cerr<<1.0*clock()/CLOCKS_PER_SEC<<'\n';
}