#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;
template < typename T = int > using OSI = ostream_iterator< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }

void in_impl(){};
template < typename T, typename... TS > void in_impl( T &head, TS &... tail ){ cin >> head; in_impl( tail ... ); }
#define IN( T, ... ) T __VA_ARGS__; in_impl( __VA_ARGS__ );

template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

#define NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )

#define SZ( v ) ( (int)( v ).size() )
#define EXISTS( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

//     Λ   Λ＿_
//  ／(*ﾟーﾟ)／＼
// ／| ￣U U￣|＼／
//   |      |／

constexpr auto INF = LIM< LL >::max() / 2;

int main()
{
	cin.tie( nullptr );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	IN( int, N, T );
	VI A( N );
	cin >> A;

	const int n = N / 2;
	const int m = N - n;
	VT< LL > after_half( 1, -INF );
	REP( s, 1 << m )
	{
		LL r = 0;
		REP( i, m )
		{
			if ( s & 1 << i )
			{
				r += A[ n + i ];
			}
		}
		after_half.PB( r );
	}
	sort( ALL( after_half ) );

	VT< LL > befor_half;
	REP( s, 1 << n )
	{
		LL r = 0;
		REP( i, n )
		{
			if ( s & 1 << i )
			{
				r += A[i];
			}
		}
		befor_half.PB( r );
	}
	sort( ALL( befor_half ) );

	auto pos = end( after_half ) - 1;
	LL res = 0;
	FOR( r, befor_half )
	{
		for ( ; T - r < *pos; --pos );
		chmax( res, r + *pos );
	}
	cout << res << endl;

	return 0;
}
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const long long MOD = 1000000007;

ll N, T, A[100];

signed main(){
    cin >> N >> T;
    REP(i, N) cin >> A[i];
    vector<ll> v, w;
    REP(i, 1 << (N / 2)){
        ll t = 0;
        REP(j, N / 2){
            if(i & (1 << j)) t += A[j];
        }
        v.push_back(t);
    }
    REP(i, 1 << (N - (N / 2))){
        ll t = 0;
        REP(j, N - N / 2){
            if(i & (1 << j)) t += A[j + N / 2];
        }
        w.push_back(t);
    }
    sort(ALL(w));
    /*
    for(auto t : v) cerr << t << " ";
    cerr << endl;
    for(auto t : w) cerr << t << " ";
    cerr << endl;
    */
    ll ans = 0;
    for(auto t : v){
        if(t > T) continue; 
        ll d = upper_bound(ALL(w), T - t) - w.begin();
        if(d == 0) ans = max(ans, t); 
        else ans = max(ans, t + w[d - 1]);
    }
    PRINT(ans);
    return 0;
}