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

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

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