#include <fstream>
#include <algorithm>

using namespace std;

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

int n, g, w[5001], p[5001], d[10001], rez;

int main()
{
    fin >> n >> g;
    for (int i = 1; i <= n; i++){
        fin >> w[i] >> p[i];
    }
    d[0]=0;
    rez = 0;
    for (int i = 1; i <= n; i++){
        for (int j = g-w[i]; j >= 0; j--){
            if (d[j+w[i]] < d[j] + p[i]){
                d[j+w[i]] = d[j] + p[i];
                if (d[j+w[i]] > rez)
                    rez = d[j+w[i]];
            }
        }
    }
    fout << rez;
    return 0;
}