N,K = map(int,input().split())
products = [int(input()) for x in range(N)]
dp = [[0 for x in range(K + 1)] for y in range(N + 1)]
for i in range(1,N+1):
    p=products[i-1]
    for w in range(K+1):
        if w<p:
            dp[i][w]=dp[i-1][w]
        else:
            dp[i][w]=max(dp[i-1][w],dp[i-1][w-p]+p)

print(dp[-1][-1])