#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

int main() {
	int n = ri(), k = ri();
	std::pair<int, int> a[n];
	for (auto &i : a) i.first = ri(), i.second = ri();
	std::sort(a, a + n, std::greater<>());
	int dp[5001][2]; // {cost, left}
	for (auto &i : dp) i[0] = 0, i[1] = -1000000000;
	for (int i = 0; i < n; i++) {
		for (int j = 5000; j >= 0; j--) {
			int cost = a[i].first;
			if (j <= 5000 - cost) dp[j + cost][1] = std::max(dp[j + cost][1], dp[j][0] + a[i].second);
			dp[j][0] = std::max(dp[j][0], dp[j][1] + a[i].second);
		}
	}
	int res = 0;
	for (int i = 0; i <= k; i++) res = std::max({res, dp[i][0], dp[i][1]});
	printf("%d\n", res);
	return 0;
}