#include <cstdio>
#include <algorithm>
using namespace std;

#define MAXN 5010
#define MAXG 10010
int N, G, Pmax;
int W[MAXN], P[MAXN];
int D[MAXN][MAXG];

int main()
{
    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]);
    for(int i = 1; i <= N; ++i)
        for(int cw = 0; cw <= G; ++cw)
        {
            D[i][cw] = D[i-1][cw];

            if(W[i] <= cw)
                D[i][cw] = max(D[i][cw], D[i - 1][cw - W[i]] + P[i]);
        }

    Pmax = D[N][G];

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

    return 0;
}