#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int N, K, ans = 0;
vector<int> a;

int dfs(int i, int sum){
    if(sum > K || i >= N) return 0;
    ans = max(sum, ans);
    dfs(i+1, sum+a[i+1]);
    dfs(i+1, sum);
}
int main(){
    cin >> N >> K;
    int temp;
    for(int i=0; i<N; ++i){
        cin >> temp;
        a.push_back(temp);
    }
    dfs(0, 0);
    dfs(0, a[0]);
    
    cout << ans << endl;
}