#include <fstream>
using namespace std;

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

int n, g;
int d[10001];

struct elem{
    int w, p;
}a[5001];


int main() {
    in >> n >> g;

    for (int i = 0; i < n; ++i)
        in >> a[i].w >> a[i].p;

    d[a[0].w] = a[0].p;

    for (int i = 1; i < n; ++i)
        for (int j = g; j >= 0; --j)
            if (j >= a[i].w) d[j] = max(d[j], d[j-a[i].w] + a[i].p);

    out << d[g];
    return 0;
}