# include <iostream>
using namespace std;

int n , g , w[5005] , p[5005] , best[5005][10005] , p_final = 0;

int main ()
{
	freopen ("rucsac.in" , "r" , stdin);
	freopen ("rucsac.out" , "w" , stdout);
	
	scanf ("%d%d" , &n , &g);
	
	for (int i = 1 ; i <= n ; ++i)
		scanf ("%d%d" , &w[i] , &p[i]);
	
	for (int i = 1 ; i <= n ; ++i)
		for (int j = 1 ; j <= g ; ++j)
		{
			if (w[i] <= j)
				best[i][j] = max (best[i - 1][j] , best[i - 1][j - w[i]] + p[i]);
			
			if (i == n && best[i][j] > p_final)
				p_final = best[i][j];
				
		}
	
	printf ("%d" , p_final);
	
	return 0;
}