from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline

N,K = map(int,input().split())
PD = [tuple(map(int,input().split())) for _ in range(N)]
PD.sort(reverse=True)

INF = (1<<60)

dp = [[-INF]*(K+2) for i in range(2)]
dp[0][0] = 0

for i in range(N):
    
    p,d = PD[i]
    
    
    
    for j in range(K,-1,-1):
        
        
        dp[0][min(j+p,K+1)] = max(dp[0][min(j+p,K+1)],dp[1][min(j+p,K+1)]+d)
        
        dp[1][min(j+p,K+1)] = max(dp[1][min(j+p,K+1)],dp[0][j] + d)
        
        
    
print(max(max(dp[0][:K+1]),max(dp[1][:K+1])))