#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g;
int w[5005], p[5005];
int d[10005];
int maxx;
int main() {
    fin >> n >> g;
    for (int i = 1; i <= n; ++i) {
        fin >> w[i] >> p[i];
    }
    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]] > maxx) {
                    maxx = d[j + w[i]];
                }
            }
        }
    }
    fout << maxx;
    fout.close();
    return 0;
}