#include <bits/stdc++.h>
using namespace std;

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

int n, g, w[5005], p[5005], dp[2][10005];

int main() {
	fin >> n >> g;
	for(int i = 1; i <= n; i++)
		fin >> w[i] >> p[i];

	for(int i = 1; i <= n; i++)
		for(int j = 0; j <= g; j++) {
			dp[i&1][j] = dp[(i-1)&1][j];
			if(j >= w[i]) 
				dp[i&1][j] = max(dp[i&1][j], dp[(i-1)&1][j-w[i]]+p[i]);
		}

	fout << dp[n&1][g];
}