using namespace std;
#include<fstream>
#include<algorithm>
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int W[5005],P[5005],DP[5005][10005];



int main()
{
		int N,G,i,j;
	fin>>N;
	fin>>G;
	for(i=1;i<=N;i++)
	{
		fin>>W[i];
		fin>>P[i];
	}
	for(i=1;i<=N;i++)
		for(j=1;j<=G;j++)
		{
			DP[i][j]=DP[i-1][j];
			if(j-W[i]>=0)
				DP[i][j]=max(DP[i][j],DP[i-1][j-W[i]]+P[i]);
		}
	fout<<DP[N][G];
	return 0;
}