#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
#define ll long long
ll w[50],s[50],ans;
bool cm(int a,int b){	return a>b;}
bool f[50];
ll n,m;
void dfs(int x,ll now)
{
	ans=max(ans,now);
	if(ans==m||ans+w[n]>m)	return;
	for(int i=x+1;i<=n;i++)
	{
		if(now+w[i]>m)	break;
		if(now+s[i]<=ans)	break;
		dfs(i,now+w[i]);
	}
}
int main()
{
	freopen("drink.in","r",stdin);
	freopen("drink.out","w",stdout);
	cin>>n>>m;
	for(int i=1;i<=n;i++)	cin>>w[i];
	sort(w+1,w+1+n,cm);
	for(int i=n;i>=1;i--)	s[i]=s[i+1]+w[i];
	dfs(0,0);
	cout<<ans<<endl;
}