#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ll LINF=1e18;
const ld PI=abs(acos(-1));
int n,k,a[25];

int main(){
	cin >> n >> k;
	REP(i,0,n) cin >> a[i];
	
	int ma=0;
	REP(i,0,(1<<n)){
		int s=0;
		REP(j,0,n) if((i>>j)&1) s+=a[j];
		if(s<=k) ma=max(ma,s);
	}
	
	cout << ma << endl;
	return 0;
}