#include <stdio.h>
#include <algorithm>
using namespace std;


constexpr int kN = int(5E3 + 10);

struct Product {
	int p, d;
	void in() {
		scanf("%d%d", &p, &d);
		return ;
	}
};

bool cmp(Product a, Product b) {return a.p < b.p;}

Product a[kN];
int dp[kN][kN], x[kN];

int main() {
	int n, k;
	scanf("%d%d", &n, &k);
	for (int i = 1; i <= n; i++) a[i].in();
	sort(a + 1, a + n + 1, cmp);
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < a[i].p; j++) dp[i][j] = dp[i - 1][j];
		for (int j = a[i].p; j <= k; j++) dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - a[i].p] + a[i].d);
		for (int j = a[i].p; j <= k; j++) dp[i][j] = max(dp[i][j], x[j - a[i].p] + a[i].d);
		for (int j = 0; j <= k; j++) x[j] = max(x[j], dp[i - 1][j] + a[i].d);
	}
	printf("%d\n", dp[n][k]);
}