#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;

int main() {
	int n, k;
	cin >> n >> k;
	VI a(n);
	rep(i, n)cin >> a[i];

	int ans = 0;
	for (int i = 0; i < (1 << n); i++) {
		int sum = 0;
		bool flag = false;
		rep(j, n) {
			if (i&(1 << j))sum += a[j];
			if (sum > k) { flag = true; break; }
		}
		if (flag)continue;
		if (ans < sum&&sum <= k)ans = sum;
		if (ans == k)break;
	}
	cout << ans << endl;
}