#include<bits/stdc++.h>
using namespace std;
int n,x;
vector<int>f[100005]; 
int a[100005];
int main(){
	scanf("%d%d",&n,&x);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	for(int i=0;i<=n;i++)f[i].resize(x/max(1,i)+1,0x3f3f3f3f);
	for(int i=n;i>=0;i--){
		if(a[i]<f[i].size())f[i][a[i]]=min(f[i][a[i]],0);
		for(int j=0;j<f[i].size();j++){
			if(j<f[i+1].size() && f[i+1][j]+j+2<=x)f[i][j]=min(f[i][j],f[i+1][j]+j+2);
			if(j-a[i]>=0 && j-a[i]<f[i+1].size() && f[i+1][j-a[i]]+j-a[i]+2<=x)f[i][j]=min(f[i][j],f[i+1][j-a[i]]+j-a[i]+2);
		}
	}
	int ans=0;
	for(int i=0;i<f[0].size();i++)if(f[0][i]<=x)ans=i;
	printf("%d",ans);
	return 0;
	//quod erat demonstrandum
}