#include<stdio.h>
#include<bits/stdc++.h>
#define fir first
#define sec second
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
template<typename type>
inline void chmin(type &x,const type &y)
{
	if(y<x)
		x=y;
}
template<typename type>
inline void chmax(type &x,const type &y)
{
	if(x<y)
		x=y;
}
constexpr int Max=4e5+10;
int n,m,S,a[Max];
vector<pii>f[Max];
inline vector<pii>update(const vector<pii>&f)
{
	vector<pii>g;
	for(auto [x,y]:f)
		if(g.empty())
			g.emplace_back(x,y);
		else
			if(g.back().sec>=x-1)
				chmax(g.back().sec,y);
			else
				g.emplace_back(x,y);
	return g;
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	cin>>n>>S;
	for(int i=1,x;i<=n;++i)
		cin>>x,++a[x];
	int L=a[0],R=0;
	for(int i=2;i<=S;++i)
		R+=a[i]*(i-1);
	const int lim=L+R;
	m=a[1];
	vector<pii>o;
	for(int i=0;i<=S;++i)
	{
		if(i==1)
			continue;
		for(int j=0;a[i]>=(1<<j);a[i]-=1<<j,++j)
			o.emplace_back(i,1<<j);
		if(a[i])
			o.emplace_back(i,a[i]);
	}
	f[L].emplace_back(0,m);
	vector<pii>g;
	auto add=[&](int i,int x,int y)->void
	{
		int j=i+(x-1)*y;
		if(j<0||j>lim)
			return;
		g.resize(f[i].size()+f[j].size());
		int w=0;
		for(auto [l,r]:f[i])
			g[w++]=pii(l+y,r+y);
		for(auto tmp:f[j])
			g[w++]=tmp;
		inplace_merge(g.begin(),g.begin()+f[i].size(),g.end());
		f[j]=update(g);
	};
	for(auto [x,y]:o)
	{
		if(!x)
			continue;
		for(int i=lim;i>=L;--i)
			add(i,x,y);
	}
	for(auto [x,y]:o)
	{
		if(x)
			break;
		for(int i=0;i<=lim;++i)
			add(i,x,y);
	}
	ll ans=0;
	for(int i=0;i<=lim;++i)
		for(auto [l,r]:f[i])
			ans+=r-l+1;
	cout<<ans<<"\n";
	return 0;
}