#include <fstream>

#include <vector>

using namespace std;

ifstream fin ("rucsac.in");

ofstream fout ("rucsac.out");

int main () {

	int n, w;

	fin >> n >> w;

	vector<long long> dp (w + 1);

	for (int i = 1; i <= n; ++i) {

		int wi, v;

		fin >> wi >> v;

		for (int j = w; j >= wi; --j)
			dp[j] = max (dp[j], dp[j - wi] + v);
	}

	long long maxim = 0;

	for (int i = 0; i <= w; ++i)
		maxim = max (dp[i], maxim);
	
	fout << maxim;

	return 0;
}