#include<bits/stdc++.h>
using namespace std;
int n,G,w[10100],g[10100],dp[3][11000];
int main()
{
	ifstream cin("rucsac.in");
	ofstream cout("rucsac.out");
	cin >> n >> G;
	for (int i = 1; i <= n; i++)
	{
		cin >> g[i] >> w[i];
	}
	for (int i = 1; i <= n; i++ )
	{
		for(int j = 0; j <= G; j++)
		{
			if (j-g[i] >= 0)dp[1][j]= max(dp[0][j], dp[0][j-g[i]] + w[i]);
		}
		for(int j = 0; j <= G; j++) dp[0][j] = dp[1][j];
	}
	cout << dp[1][G];
}