#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
#define D(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
using LL=long long;
int cnt1;
inline void unite(vector<int>&u,const vector<int>&v,int offset){
	vector<int>ret;
	int i=0,j=0;
	while(i<SZ(u)||j<SZ(v)){
		if(i<SZ(u)&&(j>=SZ(v)||u[i]<v[j]+offset)){
			if(SZ(ret)>1&&ret[SZ(ret)-2]+cnt1+1>=u[i]){
				ret.pop_back();
			}
			ret.push_back(u[i++]);
		}else{
			if(SZ(ret)>1&&ret[SZ(ret)-2]+cnt1+1>=v[j]+offset){
				ret.pop_back();
			}
			ret.push_back(v[j++]+offset);
		}
	}
	u=move(ret);
}
int calc(vector<int>&u){
	int r=-1e9;
	int ret=0;
	for(auto&x:u){
		ret+=x+cnt1+1-max(r,x);
		r=max(r,x+cnt1+1);
	}
	return ret;
}
int main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	int n,S;
	cin>>n>>S;
	vector<int>a(n);
	vector<int>cnt(S+1);
	rep(i,0,n-1){
		cin>>a[i];
		++cnt[a[i]];
	}
	cnt1=cnt[1];
	int nowS=cnt[0];
	vector<vector<int> >dp(S+cnt[0]+1);
	rep(i,0,cnt[0]){
		dp[i].push_back(0);
	}
	rep(i,2,S)if(cnt[i]){
		auto push=[&](int k0,int t0){
			//D("push %d %d\n",k0,t0);
			//assert(nowS+t0-k0<=S+cnt[0]);
			per(j,nowS,0){
				assert(j+t0-k0<=S+cnt[0]);
				unite(dp[j+t0-k0],dp[j],t0);
			}
			nowS+=t0-k0;
			/*rep(j,0,nowS){
				D("dp[%d] : ",j);
				for(auto&x:dp[j])D("%d ",x);
				D("\n");
			}*/
		};
		// rep(j,1,cnt[i])push(1,i);
		int c=cnt[i];
		for(int j=1;j<=c;j<<=1){
			c-=j;
			push(j,j*i);
		}
		if(c)push(c,c*i);
	}
	LL ans=0;
	assert(nowS<=S+cnt[0]);
	rep(i,0,nowS){
		ans+=calc(dp[i]);
	}
	printf("%lld\n",ans);
	return 0;
}