#include<bits/stdc++.h>
#define For(i,l,r) for(int i=l; i<=r; i++)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
using namespace std;
typedef long long ll;
int c[200005];
struct node{
    int x,y;
}w[200005]; int wl;
int mi[200005],ma[200005];
int q[400005][45],ql[400005];
int t[45],tl;
int main(){
    IOS
    int n,s,m=0; cin>>n>>s;
    For(i,1,n){
        int x; cin>>x;
        if (x==1) ++m; else ++c[x];
    }
    For(i,0,s) if (c[i]){
        int x=c[i],y=1;
        while(x>y){
            w[++wl]=node{y,(i-1)*y};
            x-=y; y<<=1;
        }
        w[++wl]=node{x,(i-1)*x};
    }
    //pr
    //For(i,1,wl) cout<<w[i].x<<' '<<w[i].y<<'\n';
    //2
    For(i,1,wl){
        mi[i]=mi[i-1]+min(0,w[i].y);
        ma[i]=ma[i-1]+max(0,w[i].y);
    }
    //3
    int off=-mi[wl];
    q[off][ ++ql[off] ]=0;
    For(ii,1,wl){
        int x=w[ii].x,y=w[ii].y; //ge shu, ji shu
        if (y<0){
            For(j,mi[ii-1],ma[ii-1])
                For(k,1,ql[off+j]){
                    int tmp=q[off+j][k];
                    q[off+j+y][ ++ql[off+j+y] ]=tmp+x;
                }
        }
        else{
            for(int j=ma[ii-1];j>=mi[ii-1];--j)
                For(k,1,ql[off+j]){
                    int tmp=q[off+j][k];
                    q[off+j+y][ ++ql[off+j+y] ]=tmp+x;
                }
        }
        //qu chong
        For(j,mi[ii],ma[ii]){
            memcpy(t,q[off+j],(ql[off+j]+1)*4);
            tl=ql[off+j]; ql[off+j]=0;
            sort(t+1,t+1+tl);
            int i=1;
            while(i<=tl){
                q[off+j][ ++ql[off+j] ]=t[i];
                int nex=i;
                while(nex<=tl&&t[nex]<=t[i]+m) ++nex;
                //
                if (nex==i+1) i=nex;
                else i=nex-1;
            }
        }
    }
    //ans
    ll ans=0;
    For(j,mi[wl],ma[wl]) if (ql[off+j]){
        For(i,1,ql[off+j]-1) ans+=min(m+1,q[off+j][i+1]-q[off+j][i]);
        ans+=(m+1);
    }
    cout<<ans<<'\n';
}