#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
inline ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-f;ch=getchar();}
	while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	return x*f;
}
inline void write(ll x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
const ll N=2e5+9;
ll n,S,a[N],bin[N],L=N,R=N;
vector<pii>dp[N*2+9];
bool intersect(pii a,pii b){
	return !(a.first>b.second||a.second<b.first);
}
pii mg(pii a,pii b){
	return make_pair(min(a.first,b.first),max(a.second,b.second));
}
void append(vector<pii>&a,pii b){
	if(!a.size())a.push_back(b);
	else {
		if(intersect(a.back(),b))a.back()=mg(a.back(),b);
		else a.push_back(b);
	}
}
void merge(vector<pii>&a,vector<pii>&b,ll w){
	vector<pii>c;
	vector<pii>::iterator ita=a.begin(),itb=b.begin();
	while(ita!=a.end()||itb!=b.end()){
		if(ita==a.end())append(c,make_pair(itb->first+w,itb->second+w)),itb=next(itb);
		else if(itb==b.end())append(c,*ita),ita=next(ita);
		else {
			if(ita->first<itb->first+w)append(c,*ita),ita=next(ita);
			else append(c,make_pair(itb->first+w,itb->second+w)),itb=next(itb);
		}
	}
	a=c;
}
void Trans(ll v,ll c){
	if(v>0){
		per(i,R,L)merge(dp[i+v*c],dp[i],c);
		R+=v*c;
	}
	else {
		rep(i,L,R)merge(dp[i+v*c],dp[i],c);
		L+=v*c;
	}
}
bool Med;
int main(){
	cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
	n=read(),S=read();
	rep(i,1,n)a[i]=read(),bin[a[i]]++;
	dp[L].push_back(make_pair(0,bin[1]));
	rep(i,0,S){
		if(i==1||!bin[i])continue;
		ll v=bin[i];
		rep(j,0,18){
			if((1<<j)<=v)Trans(i-1,1<<j),v-=(1<<j);
		}
		if(v)Trans(i-1,v);
	}
	ll ans=0;
	rep(i,L,R){
		for(pii p:dp[i])ans+=p.second-p.first+1;
	}
	write(ans);
	return 0;
}