#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

int n, g, w[5010], p[5010], l;
int r[2][10010];

int main()
{

	in >> n >> g;

	for (int i = 1; i <= n; ++i)
	{
		in >> w[i] >> p[i];
	}

	for (int i = 1; i <= n; ++i, l = 1 - l)
	{
		for (int j = 0; j <= g; ++j)
		{
			r[1 - l][j] = r[l][j];

			if (w[i] <= j)
				r[1 - l][j] = max(r[1 - l][j], r[l][j - w[i]] + p[i]);
		}
	}
	
	out << r[n][g];

	return 0;
}