using namespace std;
#include <fstream>
#define MaxN 5010
#define MaxG 10010
int N, G, Pmax;
int W[MaxN], P[MaxN];
int X[MaxN][MaxG];
int main()
{
    ifstream fin("rucsac.in");
    ofstream fout("rucsac.out");
    fin>>N>>G;
    for (int i = 1; i <= N; ++i)
        fin>>W[i]>>P[i];
        for (int i = 1; i <= N; i++)
            for (int cw = 0; cw <= G; cw++)
            {
                X[i][cw] = X[i-1][cw];
                if (W[i] <= cw)
                    X[i][cw] = max(X[i][cw], X[i - 1][cw - W[i]] + P[i]);
            }
    fout<< X[N][G];

    return 0;
}