#include <fstream>

using namespace std;

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

const int GMAX = 10000,
          NMAX = 5000;

int D[GMAX + 1], W[NMAX + 1], P[NMAX + 1];
int N, G;

int main()
{
    f >> N >> G;
    for(int i = 1; i <= N; i++)
        f >> W[i] >> P[i];
    for(int i = 1; i <= N; i++)
        for(int j = G; j >= 0; j--)
            if(j >= W[i])
                D[j] = max(D[j], D[j - W[i]] + P[i]);
    g << D[G];
    f.close();
    g.close();
    return 0;
}