#include<stdio.h>
int d[5][10005];
int max(int a,int b)
{
	if(a>b)
		return a;
	else
		return b;
}
int main()
{
	freopen("rucsac.in","r",stdin);
	freopen("rucsac.out","w",stdout);
	int n,gr,w,g,j,i;
	scanf("%d%d",&n,&gr);
	for(i=1;i<=n;i++)
	{
		scanf("%d%d",&g,&w);
		for(j=1;j<g;j++)
			d[i%2][j]=d[(i-1)%2][j-1];
		for(j=g;j<=gr;j++)
			d[i%2][j]=max(d[(i-1)%2][j],d[(i-1)%2][j-g]+w);
	}
	printf("%d",d[n%2][gr]);
	return 0;
}