#include <bits/stdc++.h>
using namespace std;

int n,k,ans=0;
int a[20];

int dfs(int i,int sum){
    if(i==n){
    	if(sum<=k)return ans=max(ans,sum);
    	else return ans;
    }
    dfs(i+1,sum);
    dfs(i+1,sum+a[i]);
    return ans;
}

int main(){
    cin >> n >> k;
    for(int i=0;i<n;i++)cin >> a[i];
    cout << dfs(0,0) << endl;
    return 0;
}