#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
int n,G;
int a[3][10001];
int main()
{
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int i,j,w,p,l=1;
f>>n>>G;
for(i=1;i<=n;++i,l=3-l)
	{
	f>>w>>p;
	for(j=0;j<=G;++j)
		{
		a[3-l][j]=a[l][j];
		if(j>=w)
			{
			a[3-l][j]=max(a[3-l][j],a[l][j-w]+p);
			}
		}
	}
g<<max(a[l][G],a[3-l][G])<<"\n";
f.close();
g.close();
return 0;
}