#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define fi first
#define se second
template<typename C, typename T> inline C min(T v) {return *min_element(v);}
template<typename C, typename T> inline C max(T v) {return *max_element(v);}
#define sum(a, b) accumulate(a, b)
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
template <class T> inline void print(T t){cout << t << "\n";}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
vi solve(int n, int k) {
	int a;
	vi v;
	rep(i, 0, n) {
		cin >> a;
		v.eb(a);
	}
	vi t;
	rep(i, 0, 1 << n) {
		int w = 0;
		rep(j, 0, n) {
			if ((i >> j) & 1) {
				w += v[j];
			}
		}
		if (w <= k) {
			t.eb(w);
		}
	}
	return t;
}
int main() {
	int n, k; cin >> n >> k;
	int n2 = n / 2;
	vi v1 = solve(n2, k);
	vi v2 = solve(n - n2, k);
	sort(all(v2));
	int ans = 0;
	for (auto x: v1) {
		for (auto y: v2) {
			if (x + y <= k) {
				chmax(ans, x + y);
			} else {
				break;
			}
		}
	}
	print(ans);
	return 0;
}