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

using namespace std;

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

int main()
{
	int n, g, w[5001], p[5001];
	in >> n >> g;

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

	int r[5001][10001];

	for (int i = 0; i <= g; ++i)
		r[0][i] = 0;

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

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