#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>

#define rep(i,N) for(int (i)=0;(i)<(N);(i)++)
#define MOD 1000000007

using namespace std;

int powmod(int a, int b, int p) {
	if (b == 0)return 1;
	else if (b % 2 == 0)return (powmod(a*a, b / 2, p) % p);
	else return (powmod(a, b - 1, p)*a%p);
}

int factorialmod(int a, int p) {
	if (!a)return 1;
	else return a * factorialmod(a - 1, p) % p;
}

int N,K,ans = 0;
int a[25];

int main(){
	scanf("%d %d", &N, &K);
	rep(i, N)scanf("%d", &a[i]);
	for (int i = 0; i < (1 << N); i++) {
		int temp = 0;
		for (int j = 0; j < N; j++) {
			if ((i >> j) & 1)temp += a[j];
		}
		if (temp <= K)ans = max(ans, temp);
	}
	printf("%d\n", ans);
	return 0;
}