#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = (a >= b ? a : b)
#define chmin(a, b) a = (a <= b ? a : b)
#define out(a) cout << a << endl
#define outa(a, n) rep(_, n) cout << a[_] << " "; cout << endl
#define SZ(v) (int)v.size()
#define inf (int)(1e9+7)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)
#define FIX(a) fixed << setprecision(a)

int k;
vector<int> calc(int n, vector<int> a) {
    vector<int> ret;
    rep(i, (1 << n)) {
        int sum = 0;
        rep(j, n) {
            if (i & (1 << j)) {
                sum += a[j];
                if (sum > k) { sum = 0; break; }
            }
            ret.eb(sum);
        }
    }
    return ret;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n >> k;
    int nn = min(10, n);
    vector<int> a;
    rep(i, nn) { int tmp; cin >> tmp; a.eb(tmp); }
    a = calc(nn, a);
    sort(all(a));
    auto it = upper_bound(all(a), k) - a.begin();
    int ans = a[it - 1];
    if (ans == k || n < 11) { out(ans); return 0; }
    vector<int> b;
    rep(i, n - nn) { int tmp; cin >> tmp; b.eb(tmp); }
    b = calc(n - nn, b);
    sort(all(b));
    rep(i, SZ(a)) {
        auto it = upper_bound(all(b), k - a[i]) - b.begin();
        if (it == 0) continue;
        chmax(ans, a[i] + b[it - 1]);
    }
    out(ans);
}