#include <cstdio>
#include <set>
#include <vector>
#include <algorithm>
#define x first
#define y second
#define pb push_back
using std::set;
using std::pair;
using std::vector;
const int N=200005;
int n, S, cnt[N], lw=N, up=N;
set<pair<int, int> > f[N*2];
void ins(set<pair<int, int> > &st, int l, int r)
{
	auto it=st.lower_bound({l, 0});
	if(it!=st.begin()&&prev(it)->y>=l) l=prev(it)->x, --it;
	vector<pair<int, int> > del;
	while(it!=st.end()&&it->x<=r)
	{
		del.pb(*it);
		r=std::max(r, it->y);
		++it;
	}
	for(auto t:del) st.erase(t);
	st.insert({l, r});
}
void upt(int x, int y)
{
	if(x>0)
	{
		for(int i=up; i>=lw; --i)
		{
			for(auto [l, r]:f[i]) ins(f[i+x], l+y, r+y);
		}
		up+=x;
	}
	else
	{
		for(int i=lw; i<=up; ++i)
		{
			for(auto [l, r]:f[i]) ins(f[i+x], l+y, r+y);
		}
		lw+=x;
	}
}
int main()
{
	scanf("%d%d", &n, &S);
	for(int i=1, x; i<=n; ++i) scanf("%d", &x), ++cnt[x];
	f[lw].insert({0, cnt[1]});
	for(int i=0; i<=S; ++i) if(i!=1&&cnt[i])
	{
		int v=i-1;
		for(int j=0; (1<<j)<=cnt[i]; ++j) upt((v<<j), (1<<j)), cnt[i]-=(1<<j);
		upt(v*cnt[i], cnt[i]);
	}
	long long ans=0;
	for(int i=lw; i<=up; ++i) for(auto [l, r]:f[i]) ans+=r-l+1;
	printf("%lld\n", ans);
	return 0;
}