#include <iostream>
#include <vector>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <queue>
#include <fstream>
#include <stdio.h>
#include <string.h>
#include <iomanip>
#include <stack>
#include <climits>
#include <unordered_map>
#include <map>
#include <set>
using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

struct S
{
	int g, val;
} a[5002];

int n, G, dp[3][10002]; /// dp[i][j] = val maxima care se poate obtine din primele i obiecte de greutate totala j

int main()
{
	int i, j, L1, L2;
	fin >> n >> G;
	for (i = 1; i <= n; i++)
		fin >> a[i].g >> a[i].val;
	dp[0][a[1].g] = a[1].val;
	L1 = 0; L2 = 1;
	for (i = 2; i <= n; i++)
	{
		for (j = 0; j <= G; j++)
		{
			/// nu il pun
			dp[L2][j] = dp[L1][j];
			/// il pun
			if (j >= a[i].g) dp[L2][j] = max(dp[L2][j], a[i].val + dp[L1][j - a[i].g]);
		}
		swap(L1, L2);
	}
	int ans = -1;
	for (j = 0; j <= G; j++)
		ans = max(ans, dp[L1][j]);
	fout << ans;
	return 0;
}