#include<bits/stdc++.h>
using namespace std;
int n,x;
const int M=2e4+4;
int a[M],W;
int F[2][M<<2];
inline auto& f(int now,int w){return F[now][w-W+20000];}
int GET(int num,int sum){
	int nsum=0,r;
	W=sum/2;
	for(int i=0;i<=num;i++){
		nsum+=a[i];
		if(nsum+a[i+1]>W){r=i+1;break;}
	}
	if(nsum==W)return sum-W;
	int now=1,ed=0;
	f(ed,nsum)=r;
	// cerr<<"R: "<<f(ed,nsum)<<"\n";
	for(int i=r;i<=num;i++){
		memset(F[now],0,sizeof F[now]);
		for(int j=W+x;j>=W-x;j--){
			f(now,j)=max({f(now,j),f(ed,j),f(ed,j-a[i])});
			for(int k=f(ed,j);k<f(now,j);k++)f(now,j-a[k])=max(f(now,j-a[k]),k);
			// cerr<<i<<" "<<j<<" "<<f(now,j)<<"\n";
		}
		swap(now,ed);
	}
	for(int i=W;i>=W-x;i--)if(f(ed,i)!=0)return sum-i;
	assert(0);
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	cin>>n>>x;
	for(int i=1;i<=n;i++)cin>>a[i];
	sort(a+1,a+n+1);
	a[n+1]=1e9;
	int pcnt=0;
	for(;pcnt<=n+1;pcnt++)if(a[pcnt]>x){pcnt--;break;}
	if(pcnt<=2)return cout<<a[n],0;
	else if(pcnt<=3)return cout<<max(x+1,a[n]),0;
	int sum=0,ans;
	for(int i=1;i<=pcnt;i++)a[i]=x-a[i]+1;
	reverse(a+1,a+pcnt+1);
	pcnt-=4;
	for(int i=1;i<=pcnt;i++)sum+=a[i];
	ans=GET(pcnt,sum)+x+1;
	cout<<max(ans,a[n]);
	return 0;
}