//A tree without skin will surely die.
//A man without face will be alive.
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(),(x).end()
#define rep(i,j,k) for (int i=j;i<=k;++i)
#define per(i,j,k) for (int i=j;i>=k;--i)
int const N=1e6+10;
int n,S,a[N],cnt[N];
vector< pair<int,int> >f[N];
inline void merge(int x,int y,int k){
    vector< pair<int,int> >vec1,vec2,vec;
    for (auto i:f[x]) vec1.push_back(i);
    for (auto i:f[y]) vec2.push_back({i.first+k,i.second+k});
    int l1=0,m1=vec1.size(),l2=0,m2=vec2.size();
    while (l1<m1 || l2<m2)
        if ((l1<m1) && ((l2==m2) || (vec1[l1]<vec2[l2]))) vec.push_back(vec1[l1]),++l1;
        else vec.push_back(vec2[l2]),++l2;
    f[x].clear();
    int m=vec.size();
    rep(i,0,m-1){
        int j=i,L=vec[i].first,R=vec[i].second;
        while (j+1<m && L<=vec[j+1].first && vec[j+1].first<=R+1) ++j,R=max(R,vec[j].second);
        f[x].push_back({L,R}),i=j;
    }
}
inline void solve(){
    cin>>n>>S;
    rep(i,1,n) cin>>a[i],++cnt[a[i]];
    f[0].push_back({0,0});
    rep(i,0,S){
        if (!cnt[i]) continue;
        vector<int>vec;
        int x=1;while (x<=cnt[i]) vec.push_back(x),cnt[i]-=x,x<<=1;
        if (cnt[i]) vec.push_back(cnt[i]);
        for (auto p:vec) per(j,n,p) merge(j,j-p,i*p);
    }
    int ans=0;
    rep(i,0,n) for (auto j:f[i]) ans+=j.second-j.first+1;
    cout<<ans<<'\n';
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while (t--) solve();
    cerr<<"Time: "<<(double)clock()/CLOCKS_PER_SEC<<" s\n";
    return 0;
}