#include<cstdio>
#include<algorithm>
using namespace std;
int f[100000001]={0};
int w[41];
int n,num,k=0;
bool s[41];
inline int max(const int &a,const int &b){return a<b?b:a;}
void Int(){
	freopen("drink.in","r",stdin);
	freopen("drink.out","w",stdout);
	scanf("%d %d",&n,&num);
	int ttt=0;
	for(int i=1;i<=n;++i){
		scanf("%d",&w[i]);
		ttt+=w[i];
	}
	if(ttt<=num)k=ttt;
}
int doing(){
	Int();
	if(k!=0){
		printf("%d",k);return 0;
	}
	for(int i=1;i<=n;++i){
		for(int j=num;j>=w[i];--j){
			f[j]=max(f[j],f[j-w[i]]+w[i]);
		}
	}
	printf("%d",f[num]);
	return 0;
}
int a=doing();
int main(){;}