#include <fstream>

using namespace std;

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

    int n, g;
    fin >> n >> g;

    vector<int> w(n + 1);
    vector<int> p(n + 1);
    for (int i = 1; i <= n; i++) {
        fin >> w[i] >> p[i];
    }

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

    fout << dp[n][g];

    fin.close();
    fout.close();
    return 0;
}