from itertools import combinations

n, k = map(int, input().split())

W = [int(input()) for _ in range(n)]

ans = 0
for i in range(1, n+1):
    for j in list(combinations(W, i)):
        if sum(j) <= k:
            ans = max(ans, sum(j))
print(ans)