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