#include <cstdio>
#include <algorithm>

using namespace std;

#define MAXN 5002
#define GMAX 10002
int N, G, Pmax;
int W[MAXN], P[MAXN];
//int D[MAXN][MAXG];
int Sol[GMAX];

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

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

    /// Dinamica D[i][cw] - profitul maxim pe care-l putem obtine adaugand o submultime a primelor i obiecte, insumand greutatea cw
    for(int i = 1; i <= N; ++i)
        for(int j = G-W[i]; j >= 0; --j)
        {
            /*
            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]);
            */
            if( Sol[j+W[i]] < Sol[j] + P[i] ){
                Sol[j+W[i]] = Sol[j] + P[i];
              Pmax = max (Pmax, Sol[j + W[i]]);
            }
        }
    //Pmax = D[N][G];

    /* //afisare cu matrice
        for(int i = 1 ; i <= N; i++)
        {
            for(int cw = 1 ; cw <= G ; cw++)
            {
                printf("%3d",D[i][cw]);
            }
            printf("\n");
        }
        */
    /// Afisare

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

    return 0;
}