N, K = list(map(int, input().split()))

A = [int(input()) for _ in range(N)]


# 以下は全探索のアルゴリズム（TLEだった）
"""
def bin_search(item_index, rest_weight):
    if item_index == N:
        return 0
    elif rest_weight < A[item_index]:
        return bin_search(item_index + 1, rest_weight)
    else:
        res1 = bin_search(item_index + 1, rest_weight)
        res2 = bin_search(item_index + 1, rest_weight - A[item_index]) + A[item_index]

        return max(res1, res2)

print(bin_search(0, K))
"""
# 以下は動的計画法（メモ化）のアルゴリズム
memo = [[-1 for _ in range(K+1)] for _ in range(N+1)]

def do_dp_memo(item_index, rest_weight):
    if memo[item_index][rest_weight] != -1:
        return memo[item_index][rest_weight]
    else:
        if item_index == N:
            res = 0
        elif rest_weight < A[item_index]:
            res = do_dp_memo(item_index + 1, rest_weight)
        else:
            res1 = do_dp_memo(item_index + 1, rest_weight)
            res2 = do_dp_memo(item_index + 1, rest_weight - A[item_index]) + A[item_index]
            res = max(res1, res2)

        memo[item_index][rest_weight] = res
        return res

print(int(do_dp_memo(0, K)))