#include <fstream>
#include <iostream>

using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

inline int Maxim(int a, int b){ return a>b?a:b; }

int a[10001], b[10001];

int main()
{
	int n,gmax;
	int g[5005],p[5005];
	if(! fin )
		return -1;
	fin >> n >> gmax;
	for(int i=1 ; i<=n ; i++)
		fin>>g[i]>>p[i];
	for(int i=1;i<=n;i++){
		for(int j=1 ; j<=gmax ;++j)
			if(j-g[i]<0)
				b[j] = a[j];
			else
				b[j] = Maxim(a[j], a[j-g[i]] + p[i]);
		for(int j=1;j<=gmax ; ++j)
			a[j] = b[j];
		
	}
	fout << a[gmax] << "\n";
	
	return 0;
}