#include<bits/stdc++.h>
#define int long long
using namespace std;
bool stmemory;
namespace Call_me_Eric{
inline int read(){
    int x = 0, f = 1;char ch = getchar();
    while(ch < '0' || ch > '9'){if(ch == '-') f = -1;ch = getchar();}
    while(ch >= '0' && ch <= '9'){x = (x << 1) + (x << 3) + (ch ^ 48);ch = getchar();}
    return x * f;
}
const int maxn = 2e5 + 10;
typedef pair<int,int> pii;
int n, S;
int buc[maxn];
int lw = maxn, up = maxn;
vector<pii> f[maxn * 3];
void merg(vector<pii> &a,vector<pii> b,int add){
    map<int,int> mp;mp.clear();vector<pii> res;res.clear();
    for(pii i : a){mp[i.first]++;mp[i.second + 1]--;}
    for(pii i : b){mp[i.first + add]++;mp[i.second + add + 1]--;}
    int x = 0, l = -1, r = -1;
    for(auto i : mp){
        x += i.second;
        if(x == 0){r = i.first - 1;res.push_back(make_pair(l,r));l = -1;}
        if(x && l == -1){l = i.first;}
    }
    a = res;
}
void upd(int x,int y){
    if(x > 0){
        for(int i = up;i >= lw;i--)merg(f[i + x],f[i],y);
        up += x;
    }
    else{
        for(int i = lw;i <= up;i++)merg(f[i + x],f[i],y);
        lw += x;
    }
}
void main(){
    n = read(); S = read();for(int i = 1;i <= n;i++){buc[read()]++;}
    
    f[lw].push_back(make_pair(0,buc[1]));
    for(int i = 0;i <= S;i++)if(buc[i] && i != 1){
        int val = i - 1;
        for(int j = 1;buc[i] >= j;j <<= 1){upd(val * j,j); buc[i] -= j;}
        if(buc[i]){upd(val * buc[i],buc[i]);}
    }
    int ans = 0;
    for(int i = lw;i <= up;i++)for(pii j : f[i])ans += j.second - j.first + 1;
    printf("%lld\n",ans);
    return;
}
};
bool edmemory;
signed main(){
    auto stclock = clock();
    Call_me_Eric::main();
    auto edclock = clock();
    cerr << (&stmemory - &edmemory) / 1024.0 / 1024.0 << " Mib cost.\n";
    cerr << (edclock - stclock) * 1.0 / CLOCKS_PER_SEC << " Sec cost.\n";
    return 0;
}