#include <bits/stdc++.h>
#include "bits/stdc++.h"
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <unordered_map>
#include <string.h>
#include <utility>

typedef long long ll;
const int INF = 1e8;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;

typedef pair<int, int> P;

int d[21];
int n = 0,k=0;

int ans =-1;

void dfs(int i, int w){


	if(w >k){
		return;
	}
	if(i == n){
		if(w <=k){
		ans = max(ans,w);
		}
		return;
	}

	dfs(i+1,w);

	dfs(i+1,w+d[i]);
}

int main() {


	cin >> n>>k;

	int tmp=0;
	for(int i=0; i<n;i++){
		cin>>tmp;

		d[i] = tmp;
	}

	dfs(0,0);

	cout<<ans<<endl;




	return 0;
}