#include <iostream>
using namespace std;
int mx,n,k,lst[20];

void solve(int d,int sum){
    if(d==n){
        mx = max(mx,sum);
        return;
    }
    if(sum+lst[d]<=k)solve(d+1,sum+lst[d]);
    solve(d+1,sum);
}

int main(void){
    int i;cin>>n>>k;
    mx = 0;
    for(i=0;i<n;i++)cin>>lst[i];
    solve(0,0);
    cout<<mx<<endl;
}