#include <fstream>
#include <algorithm>
using namespace std;

ifstream is("rucsac.in");
ofstream os("rucsac.out");

int n, g, maxim;
int c[5001], w[5001];
int d[2][10010];

int main()
{
    is >> n >> g;
    for(int i = 1; i <= n; ++ i)
    {
        is >> w[i] >> c[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]] + c[i]);

        }
    }
    maxim = d[l][g];
    os << maxim;
    is.close();
    os.close();
    return 0;
}