import itertools

N, K = map(int, input().split())
A = sorted([int(input()) for _ in range(N)])

ans = 0
for i in range(1, N + 1):
	combs = sorted(itertools.combinations(A, i))
	for comb in combs:
		sum_val = sum(comb)
		if sum_val <= K:
			ans = max(ans, sum_val)
print(ans)