#include<cstdio>
using namespace std;
int n,m,i,j,G,g,w;
int d[10001];
int maxim(int a,int b)
{
	if(a>b)
		return a;
	return b;
}
int main()
{
	freopen("rucsac.in","r",stdin);
	freopen("rucsac.out","w",stdout);
	scanf("%d%d",&n,&G);
	for(i=1;i<=n;i++)
	{
		scanf("%d%d",&g,&w);
		for(j=G;j>=g;j--)
		{
			d[j]=maxim(d[j],d[j-g]+w);
		}
	}
	printf("%d\n",d[G]);
	return 0;
}