#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

const int MAXG = 10010;
int dp[MAXG], n, g, w, p;

int main() {
    fin >> n >> g;
    for (int i = 1; i <= n; ++i) {
        fin >> w >> p;
        for (int j = g; j - w >= 0; --j)
            dp[j] = max(dp[j], p + dp[j - w]);
    }
    fout << dp[g];
    return 0;
}