#include <fstream>
#define MAXN 5010
#define MAXG 10010
using namespace std;
ifstream f("rucsac.in"); ofstream g("rucsac.out");
int  W[MAXN], P[MAXN],D[MAXN][MAXG],N, G, Pmax;
int main()
{   f>>N>>G;
    for(int i = 1; i <= N; ++i) f>>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 cw = 0; cw <= G; ++cw)
        {   D[i][cw] = D[i-1][cw];// Mai intai nu punem obiectul i.
            if(W[i] <= cw) D[i][cw] = max(D[i][cw], D[i - 1][cw - W[i]] + P[i]);
        }
    g<<D[N][G]<<'\n'; g.close(); return 0;
}