#include<fstream>
using namespace std;
#define maxn 5001
#define maxg 10001
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int w[maxn], p[maxn], g, n, i, cw, optim[maxg];
int sol, j;
int main() {
    fin >> n >> g;
    for (i = 1; i <= n; i++)
        fin >> w[i] >> p[i];
    for (i = 1; i <= n; i++)
        for (j = g - w[i]; j >= 0; j--)
            if (optim[j + w[i]] < optim[j] + p[i])
                optim[j + w[i]] = optim[j] + p[i];
    fout << optim[g];
}