#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<random>
#include<iomanip>
#include<queue>
#include<stack>
#include<assert.h>
#include<time.h>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define ggr getchar();getchar();return 0;
#define prique priority_queue
constexpr auto mod = 1000000007;
#define inf 1e15
#define key 1e9
using namespace std;
typedef pair<int, int>P;
template<class T> inline void chmax(T& a, T b) {
	a = std::max(a, b);
}
template<class T> inline void chmin(T& a, T b) {
	a = std::min(a, b);
}
//combination(Nが小さい時はこれを使う
const int MAX = 2330000;
int fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i < MAX; i++) {
		fac[i] = fac[i - 1] * i % mod;
		inv[i] = mod - inv[mod % i] * (mod / i) % mod;
		finv[i] = finv[i - 1] * inv[i] % mod;
	}
}
int COMB(int n, int k) {
	if (n < k) return 0;
	if (n < 0 || k < 0) return 0;
	return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
bool prime(int n) {
	int cnt = 0;
	for (int i = 1; i <= sqrt(n); i++) {
		if (n % i == 0)cnt++;
	}
	if (cnt != 1)return false;
	else return n != 1;
}
int gcd(int x, int y) {
	if (y == 0)return x;
	return gcd(y, x % y);
}
int lcm(int x, int y) {
	return x / gcd(x, y) * y;
}

//繰り返し二乗法（Nが大きい時の場合のcombination)
int mod_pow(int x, int y, int m) {
	int res = 1;
	while (y) {
		if (y & 1) {
			res = res * x % m;
		}
		x = x * x % m;
		y >>= 1;
	}
	return res;
}
int kai(int x, int y) {
	int res = 1;
	for (int i = x - y + 1; i <= x; i++) {
		res *= (i % mod); res %= mod;
	}
	return res;
}
int comb(int x, int y) {
	if (y > x)return 0;
	return kai(x, y) * mod_pow(kai(y, y), mod - 2, mod) % mod;
}
//UnionFind
class UnionFind {
protected:
	int* par, * rank, * size;
public:
	UnionFind(unsigned int size) {
		par = new int[size];
		rank = new int[size];
		this->size = new int[size];
		rep(i, size) {
			par[i] = i;
			rank[i] = 0;
			this->size[i] = 1;
		}
	}
	int find(int n) {
		if (par[n] == n)return n;
		return par[n] = find(par[n]);
	}
	void unite(int n, int m) {
		n = find(n);
		m = find(m);
		if (n == m)return;
		if (rank[n] < rank[m]) {
			par[n] = m;
			size[m] += size[n];
		}
		else {
			par[m] = n;
			size[n] += size[m];
			if (rank[n] == rank[m])rank[n]++;
		}
	}
	bool same(int n, int m) {
		return find(n) == find(m);
	}
	int getsize(int n) {
		return size[find(n)];
	}
};
int dight(int n) {
	int ans = 1;
	while (n >= 10) {
		n /= 10;
		ans++;
	}
	return ans;
}
long long modinv(long long a, long long m) {
	long long b = m, u = 1, v = 0;
	while (b) {
		long long t = a / b;
		a -= t * b; swap(a, b);
		u -= t * v; swap(u, v);
	}
	u %= m;
	if (u < 0) u += m;
	return u;
}
int n, t;
int a[44];
int memo1[1050000], memo2[1050000];
signed main() {
	cin >> n >> t;
	rep(i, n)cin >> a[i];
	rep(i, 1 << (n / 2)) {
		int cnt = 0;
		rep(j, n / 2) {
			if ((i >> j) & 1)cnt += a[j];
		}
		memo1[i] = cnt;
	}
	rep(i, 1 << (n - n / 2)) {
		int cnt = 0;
		rep(j, n - n / 2) {
			if ((i >> j) & 1)cnt += a[j + n / 2];
		}
		memo2[i] = cnt;
	}
	sort(memo1, memo1 + (1 << (n / 2)));
	sort(memo2, memo2 + (1 << (n - n / 2)));
	int ans = 0;
	rep(i, 1 << (n / 2)) {
		int p = upper_bound(memo2, memo2 + (1 << (n - n / 2)), t - memo1[i]) - memo2;
		if (p == 0)ans = ans;
		else ans = max(ans, memo1[i] + memo2[p - 1]);
	}
	cout << ans << endl;
	ggr
}

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#define debug(a) cout << #a << ": " << a << endl
using namespace std;
typedef long long ll;
const int N = 50;
int n;
ll T, a[N];
vector<ll> v;
ll get(ll x){
    int p = upper_bound(v.begin(), v.end(), x) - v.begin();
    if (p == 0) return 0;
    return v[p-1];
}
int main(void){
    scanf("%d%lld", &n, &T);
    for (int i = 1; i <= n; ++i){
        scanf("%lld", &a[i]);
    }
    int m = n / 2, k = n - m;
    for (int i = 0; i < (1<<m); ++i){
        ll s = 0;
        for (int j = 0; j < m; ++j){
            if ((i >> j) & 1){
                s += a[j+1];
            }
        }
        v.push_back(s);
    }
    sort(v.begin(), v.end());
//    debug(v.size());
//    debug(m);
//    debug(k);
    ll ans = 0;
    for (int i = 0; i < (1<<k); ++i){
        ll s = 0;
        for (int j = 0; j < k; ++j){
            if ((i >> j) & 1){
                s += a[m+j+1];
            }
        }
        //debug(s);
        if (s <= T) ans = max(ans, s + get(T-s));
    }
    printf("%lld\n", ans);
    return 0;
}
