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

using namespace std;

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

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

    vector <int> w(n), p(n);

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

    vector <vector <int> > dp(n + 1, vector <int> (g + 1, 0));
    for (int i = 1; i <= n; i++) {
        for (int gr = 1; gr <= g; gr++) {
            dp[i][gr] = dp[i - 1][gr];
            if (gr >= w[i - 1] && dp[i][gr] < dp[i - 1][gr - w[i - 1]] + p[i - 1])
                dp[i][gr] = dp[i - 1][gr - w[i - 1]] + p[i - 1];
        }
    }

    out << dp[n][g] << '\n';
    return 0;
}