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

ANS=[0]
def dfs(i,now):
    if now<=K:
        ANS[0]=max(ANS[0],now)

    for j in range(i,N):
        if now+A[j]<=K:
            dfs(j+1,now+A[j])

dfs(0,0)

print(ANS[0])