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