N, K = map(int, input().split())
A = []
for i in range(N):
    A.append(int(input()))
dp = [0] * (K + 1)
dp[0] = 1
ans = 0
for a in A:
    for i in reversed(range(K - a + 1)):
        if dp[i]:
            dp[i + a] = dp[i]
            ans = max(ans, i + a)
print(ans)