N, K, *A = map(int, open(0).read().split())

ans = 0
for i in range(2 ** N):
    t = sum(A[j] for j in range(N) if (i >> j) & 1)
    if t <= K:
        ans = max(ans, t)

print(ans)