#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define piii tuple<int,int,int>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define deb(var) cerr<<#var<<'='<<(var)<<"; "
#define int long long
int n,s,c[200010];
vector<pii> f[400010];const int D=200000;
void redu(vector<pii> &vec){
	if(vec.empty())return;
	vector<pii> tmp=vec;
	vec.clear();
	sort(tmp.begin(),tmp.end());
	int l=-1e9,r=l,L,R;
	for(auto t:tmp){
		tie(L,R)=t;
		if(l==-1e9)l=L,r=R;
		if(r>=L-1)r=max(r,R);
		else vec.pb({l,r}),l=L,r=R;
	}
	if(l!=-1e9)vec.pb({l,r});
}
void work(){
	cin>>n>>s;
	for(int i=1,x;i<=n;i++)cin>>x,c[x]++;
	vector<pii> g(0);
	for(int i=0;i<=s;i++){
		int x=c[i];
		for(int b=1;b<=x;b<<=1)
			x-=b,g.pb({i,b});if(x)g.pb({i,x});
	} 
	f[D].pb({0,0});
	for(auto t:g){
		int s,l;tie(s,l)=t;
		s*=l;
		if(s-l>0){
			for(int i=D+D;~i;i--){
				for(auto t:f[i]){
					int L,R;tie(L,R)=t;
					f[i+s-l].pb({L+s,R+s});
				}
			}
		}else if(s-l<0){
			for(int i=0;i<=D+D;i++){
				for(auto t:f[i]){
					int L,R;tie(L,R)=t;
					f[i+s-l].pb({L+s,R+s});
				}
			}
		}else{
			for(int i=0;i<=D+D;i++){
				vector<pii> G(0);
				for(auto t:f[i])G.pb(t),G.pb({t.fi+s,t.se+s});f[i]=G;
			}
		}
		for(int i=0;i<=D+D;i++)redu(f[i]);
	}
	int ans=0;
	for(int i=0;i<=D+D;i++){
		for(auto t:f[i])ans+=t.se-t.fi+1;
	}cout<<ans<<'\n';
}
signed main(){
	ios::sync_with_stdio(0),
	cin.tie(0),cout.tie(0);
	int T=1;while(T--)work();return 0;
}