#include <fstream>
#include <algorithm>

using namespace std;

ifstream f("rucsac.in");
ofstream g("rucsac.out");

int N, G, Pmax;
int W[5011], P[5011];
int D[2][10011];

int main()
{
    f>>N>>G;
    for(int i = 1; i <= N; ++i)
        f>>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] = max(D[1-l][cw], D[l][cw - W[i]] + P[i]);
        }

    Pmax = D[l][G];

    g<<Pmax;

    return 0;
}