#include <cstdio>
#include <algorithm>
using namespace std;
#define MAXN 5010
#define MAXG 10010
int N, G,W[MAXN], P[MAXN],D[2][MAXG];
int main()
{
    freopen("rucsac.in", "r", stdin);
    freopen("rucsac.out", "w", stdout);
    scanf("%d%d", &N, &G);
	int l=0,i,cw;
    for(i = 1; i <= N; ++i)
        scanf("%d%d", &W[i], &P[i]);
    for(i = 1; i <= N; ++i, l = 1 - l)
        for(cw = 0; cw <= G; ++cw)
        {
			D[1-l][cw] = D[l][cw];
            if(W[i] <= cw)
                D[1-l][cw] = max(D[1-l][cw], D[l][cw - W[i]] + P[i]);
        }
    printf("%d\n",D[l][G]);
    return 0;
}