from itertools import combinations as com
N,K = map(int,input().split())
products = [int(input()) for x in range(N)]
max_p = 0
for n in range(1,N + 1):
    for p_set in com(products,n):
        if max_p < sum(p_set) <= K:
            max_p = sum(p_set)
print(max_p)