N = 1010
dp, v, w = [0]*N, [0]*N, [0]*N


def main():
    n, m = map(int, input().split())
    for i in range(1, n + 1):
        v[i], w[i] = map(int, input().split())

    for i in range(1, n + 1):
        for j in range(m, v[i] - 1, -1):
            dp[j] = max(dp[j], dp[j - v[i]] + w[i])

    print(dp[m])


main()