#include <fstream>
#include <algorithm>

using namespace std;

long X, Y, n, i, j, w, p, d[20010], g;

int main() {
	ifstream f("rucsac.in");
	ofstream h("rucsac.out");
	
	f>>n>>g;
	for (i = 1; i <= n; ++i) {
		f>>w>>p;
		for (j = X; j >= 1; --j) 
			if (d[j]) d[j + w] = max(d[j + w], d[j] + p), 
				X = max(X, j + w);
			
		d[w] = max(d[w], p);
		X = max(X, w);
	}
	for (i = 1; i <= g; ++i) Y = max(Y, d[i]);
	h<<Y;
	return 0;
}