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

using namespace std;

int main() {
	ifstream fin("rucsac.in");
	ofstream fout("rucsac.out");
	int n, g;
	fin >> n >> g;
	vector<int> dp(g + 1, 0);
	vector<int> v(n + 1);
	vector<int> w(n + 1);
	for (int i = 1; i <= n; i++) {
		fin >> w[i] >> v[i];
	}
	for (int i = 1; i <= n; i++) {
		for (int j = g; j >= w[i]; j--) {
			dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
		}
	}
	fout << dp[g] << "\n";
}