#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N, K;
int A[30];

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> N >> K;

    for(int i=0;i<N;++i){
        std::cin >> A[i];
    }

    int mx = 0;
    for(int i=0;i<(1<<N);++i){
        int weight = 0;
        for(int j=0;j<N;++j){
            if(i >> j & 1){
                weight += A[j];
            }
        }

        if(weight <= K){
            mx = max(mx, weight);
        }
    }

    std::cout << mx << std::endl;
}