#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t n, k;
    cin >> n >> k;
    vector<int32_t> as(n);
    for (auto i = 0; i < n; ++i) {
        cin >> as[i];
    }
    int32_t ans = 0;
    for (auto i = 0; i < (1 << n); ++i) {
        int32_t sum = 0;
        for (auto j = 0; j < n; ++j) {
            if ((1 << j) & i) {
                sum += as[j];
            }
        }
        if (sum <= k)
            ans = max(ans, sum);
    }
    cout << ans << endl;
    return 0;
}