#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<utility>
#include<cstdlib>
#include<iomanip>
#include<ctime>
#include<vector>
#include<queue>
using namespace std;
bool mycmp(int xx,int yy)
{
	return xx>yy;
}
int n,m,a[45],ans=0;
long long sum[45];
void dfs(int dep,int te)
{
	if(clock()>950)
	{
		printf("%d\n",ans);
		exit(0);
	}
	if(ans==m)
	{
		printf("%d\n",ans);
		exit(0);
	}
	if(dep==n+1)
	{
		if(te>ans)
			ans=te;
		return;
	}
	if(te+sum[n]-sum[dep-1]<=ans)
		return;
	if(te+a[dep]<=m)
		dfs(dep+1,te+a[dep]);
	dfs(dep+1,te);
}
int main(){
	freopen("drink.in","r",stdin);
	freopen("drink.out","w",stdout);
	scanf("%d %d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		sum[i]=a[i]+sum[i-1];
	}
	sort(a+1,a+1+n,mycmp);
	int temp=m;
	for(int i=1;i<=n;i++)
	{
		if(temp-a[i]>=0)
		{
			temp-=a[i];
		}
	}
	ans=m-temp;
	if(ans==sum[n])
	{
		printf("%d\n",ans);
		return 0;
	}
	dfs(1,0);
	printf("%d\n",ans);
	return 0;
}