#include <fstream>

using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");

int n, g, i, j, maxim, w[5005], p[5005], d[5005];

int main()
{
    fin >> n >> g;
    for (i=1; i<=n; i++){
        fin >> w[i] >> p[i];
    }
    //d[i] = profitu maxim
    d[0] = 1;
    for (i=1; i<=n; i++){
        for (j=g; j>=0; j--){
            if (d[j] != 0 && j + w[i] <= g){
                d[j+w[i]] = max(d[j+w[i]], d[j] + p[i]);
            }
        }
    }
    for(i=0; i<=g; i++)
        maxim = max(maxim ,d[i]);
    fout << maxim-1;
    return 0;
}