#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf = 1e9+7;

int N, K;
int A[100010];
int ans;
int main() {
    cin>>N>>K;
    REP(i, 0, N){
        cin>>A[i];
    }
    REP(mask,0,1<<N){
        int sum=0;
        REP(i,0,N){
            if(mask & (1<<i)) sum+=A[i];
        }
        if(sum<=K) ans = max(sum,ans);
    }
    p(ans);
    return 0;
}