N, K = map(int, input().split())
items = []
Try = []
for shop in range(N):
    items.append(int(input()))

for way in range(2 ** N):
    bug = []
    for item in range(N):
        if ((way >> item) & 1) == 1:
            bug.append(items[item])

    Try.append(sum(bug))

    bug.clear()
movable_items = [i for i in Try if i <= K]
print(max(movable_items))