#include<cstdio>
#include<algorithm>
using namespace std;

const int MAX_N = 5001 ;
const int MAX_G = 10001 ;

int n,g ;
int pr[MAX_N],gr[MAX_N] ;
int sol[MAX_G] ;

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",&gr[i],&pr[i]);
	
	sol[gr[1]] = pr[1] ;
	for(int i=2;i<=n;++i)
		for(int j=g;j>=0;--j)
			if(j+gr[i] <= g)
				sol[j+gr[i]] = max( sol[j+gr[i]] , sol[j] + pr[i] ) ;
	
	int rasp = 0 ;
	for(int i=g;i>=0;--i)
		if(sol[i] > rasp)
			rasp = sol[i] ;
		
	printf("%d\n",rasp);
	
	return 0;
	
}