#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
	ifstream in("rucsac.in");
	ofstream out("rucsac.out");
	int n, g;
in >> n >> g;
vector<int> p (n);
vector<int> w(n);
for (int i = 0; i < n; ++i) {
	in >> w[i] >> p[i];
}

// vector<vector<int>> dp (n+1, vector<int>(g+1, 0));
vector<int> dp1 (g+1, 0);
vector<int> dp2 (g+1, 0);

for (int i = 1; i <= n; ++i) {
	for (int j = 0; j <= g; ++j) {
			dp2[j] = max(dp1[j], (w[i-1] <= j) ? p[i-1] + dp1[j - w[i-1]] : 0);
	}
	dp1 = dp2;
}
int res = 0;
for (int i = 0; i <= g; ++i)
res = max(res, dp2[i]); 
out << res << "\n";


}