#include <stdio.h>
#include <string.h>
#include <algorithm>

using namespace std;

int best[10005];

int main (void) {
	freopen("rucsac.in", "r", stdin);
	freopen("rucsac.out", "w", stdout);
	
	int N, W, w, p;
	
	scanf("%u %u", &N, &W);
	
	int m = 0;
	//go
	for (int i = 0; i < N; ++i) {
		scanf("%u %u", &w, &p);
		for (int j = W-w; j >= 0; --j) {
			int aux = j + w;
			if (best[aux] < best[j] + p) best[aux] = best[j] + p;
			if (best[aux] > m) m = best[aux];
		}
		
	}
	
	printf("%d\n", m);
	
	return 0;
}