#include <cstdio>
#include <algorithm>
#include <iostream>

#define MAXN 5010
#define MAXG 10010
int main()
{
    int N, G, Pmax;
    int W[MAXN], P[MAXN];
    int D[2][MAXG];

	freopen("rucsac.in", "r", stdin);
	freopen("rucsac.out", "w", stdout);


	scanf("%d%d", &N, &G);
	for (int i = 1; i <= N; ++i)
		scanf("%d%d", &W[i], &P[i]);


	int l = 0;
	for (int i = 1; i <= N; ++i, l = 1 - l)
		for (int cw = 0; cw <= G; ++cw)
		{
		D[1 - l][cw] = D[l][cw];
		if (W[i] <= cw)
			D[1 - l][cw] = std::max(D[1 - l][cw], D[l][cw - W[i]] + P[i]);
		}
	Pmax = D[l][G];

	printf("%d\n", Pmax);

	return 0;
}