#include <iostream>
#include <fstream>
#include <cmath>
#include <vector>
#include <bitset>
#include <queue>
#include <deque>
#include <list>
#include <ctime>
#include <string>
#include <algorithm>
using namespace std;
ifstream ff("rucsac.in");
ofstream gg("rucsac.out");

int n, g, w, p, bb[10001];

int main(){
	ff >> n >> g;
	for(int i=0;i<n;i++){
		ff >> w >> p;
		for(int j=g;j-w>=0;j--)bb[j]=max(bb[j], bb[j-w]+p); 
	}
	gg << bb[g] << "\n";
	return 0;
}