#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

int n, g, i, j, maxi;
int w[10001], p[10001], optim[10001];

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];
                if (optim[j + w[i]] > maxi)
                    maxi = optim[j + w[i]];
            }
        if (optim[w[i]] < p[i])
            optim[w[i]] = p[i];
    }
    fout << maxi;
}