#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

long d1[10010],d2[10010];

long n,i,wi,pi,j,g;

int main () {
	
	freopen("rucsac.in","r",stdin);
	freopen("rucsac.out","w",stdout);
	
	scanf("%ld%ld",&n,&g);
	
	for(i=1;i<=n;i++)
	{
		scanf("%ld%ld",&wi,&pi);
		memcpy(d1,d2,sizeof(d2));
		
		for(j=1;j<=g;j++)
		{
			if(j>=wi)
				d2[j]=max(d1[j],d1[j-wi]+pi);
			else
				d2[j]=d1[j];
		}
	}
	printf("%ld\n",d2[g]);
	return 0;
}