#include <iostream>
#include <fstream>
#define maxn 10003

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

int n, i, j, g, w[maxn], p[maxn], optim[maxn], rez;

int main () {
    
    fin >> n >> g;
    for (i = 1; i <= n; i++)
        fin >> w[i] >> p[i];
    
    optim[0] = 0;
    rez = 0;
    
    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];
                
                if (optim[j+w[i]] > rez)
                    rez = optim[j+w[i]];
            }
    
    fout << rez << "\n";
}