n, i = map(int, input().split())
dp = [0]*(i+1)
for _ in range(n):
    s, a = map(int, input().split())
    for j in range(i-s, -1, -1):
        dp[j+s] = max(dp[j+s], dp[j]+a)
print(max(dp))