#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_map>
#include <unordered_set>
#define all(a) a.begin(),a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
#define debug(x) cerr << __LINE__ << ' ' << #x << ':' << (x) << '\n'
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef complex<ld> com;
template<class T> using prique = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = 1000000010;
constexpr ll INF = 1000000000000000010;
constexpr int mod1e9 = 1000000007;
constexpr int mod998 = 998244353;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
constexpr ll ten(int n) { return n ? 10 * ten(n - 1) : 1; };
int dx[] = { 1,0,-1,0,1,1,-1,-1 }; int dy[] = { 0,1,0,-1,1,-1,1,-1 };
void fail() { cout << "-1\n"; exit(0); } void no() { cout << "No\n"; exit(0); }
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }
template<class T> istream &operator >> (istream &s, vector<T> &v) { for (auto &e : v) s >> e; return s; }
template<class T> ostream &operator << (ostream &s, const vector<T> &v) { for (auto &e : v) s << e << ' '; return s; }

struct fastio {
	fastio() {
		cin.tie(0); cout.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(20);
		cerr << fixed << setprecision(20);
	}
}fastio_;

int main() {
	ll n, t;
	cin >> n >> t;
	vector<ll> a(n);
	cin >> a;
	int m = n / 2;
	vector<ll> x(1 << m);
	vector<ll> y(1 << (n - m));
	rep(i, 1 << m) {
		rep(j, m) {
			if (i >> j & 1) {
				x[i] += a[j];
			}
		}
	}
	rep(i, 1 << (n - m)) {
		rep(j, n - m) {
			if (i >> j & 1) {
				y[i] += a[j + m];
			}
		}
	}
	y.pb(-INF);
	sort(all(x));
	sort(all(y));
	ll ans = 0;
	for (ll v : x) {
		ll rem = t - v;
		auto itr = upper_bound(all(y), rem);
		itr--;
		ll s = v + (*itr);
		chmax(ans, s);
	}
	cout << ans << '\n';
}
#include <bits/stdc++.h>
using namespace std;

#define int long long
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

int n, t;

int a[100];

set<int> zen, kou;

void dfs(int i, int ma, int now, int b){
	if(i >= ma){
		if(b == 0){
			zen.insert(now);
		}else{
			kou.insert(now);
		}
		return;
	}

	dfs(i+1, ma, now, b);
	dfs(i+1, ma, now+a[i], b);
}

signed main(){
	cin >> n >> t;

	for(int i = 0;i < n;i++){
		cin >> a[i];
	}

	dfs(0, n/2, 0, 0);
	dfs(n/2, n, 0, 1);

	int ans = 0;
	for(auto e = zen.begin(); e != zen.end();e++){
		int x = *e;
		if(x > t) continue;
		auto hoge = kou.upper_bound(t-x);
		hoge--;
		ans = max(ans, x+*hoge);
	}

	cout << ans << endl;

	return 0;
}
