#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
using namespace std;

int n, g, p[10001];

int main() {
	int w, c;
	
	freopen("rucsac.in","r",stdin);
	freopen("rucsac.out","w",stdout);
	scanf("%d %d", &n, &g);
	for (int k = 1; k <= n; k++) {
		scanf("%d %d", &w, &c);
		for (int i = g; i - w >= 0; i--) {
			p[i] = max(p[i], p[i-w]+c);
		}
	}
	printf("%d\n", p[g]);
	
	return 0;
}