#include <iostream>
#include <vector>
#include <queue>
#include <climits>
#include <fstream>

using namespace std;

int max(int a, int b) {
    if (a > b) {
        return a;
    } else {
        return b;
    }
}

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<int> dp(g+1, 0);

    for (int num = 1; num <= n; num++) {
        int cur_w = w[num];
        int cur_p = p[num];
        vector<int> prev_dp = dp;

        for (int w = 1; w <= g; w++) {
            dp[w] = prev_dp[w];

            if (cur_w <= w) {
                dp[w] = max(dp[w], prev_dp[w - cur_w] + cur_p);
            }
        }

    }

    fout << dp[g];

    fin.close();
    fout.close();

    return 0;
}