#include <stdio.h>
#include <algorithm>
#include <deque>
#include <string>
#include <iostream>
using namespace std;
using ll = long long;

void solve();
int main() {
	solve();
#ifdef DBG
	while (true);
#endif
}

//617
int n, k, A[20];
int rec(int i, int w) {
	if (n <= i)
		return w;
	int r = (w + A[i] <= k) ? rec(i + 1, w + A[i]) : w;
	r = max(r, rec(i + 1, w));
	return r;
}
void solve() {
	scanf("%d %d", &n, &k);
	for (int i = 0; i < n; i++)
		scanf("%d", A + i);
	printf("%d\n", rec(0, 0));
}