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

using namespace std;

int main() {
    ifstream in("rucsac.in");
    ofstream out("rucsac.out");
    
    int N, G;
    in >> N >> G;

    vector<int> w(N);
    vector<int> p(N);
    vector<int> dp(G + 1, 0);
    
    for (int i = 0; i < N; i++) {
        in >> w[i] >> p[i];
    }
    for (int i = 0; i < N; i++) {
        for (int j = G; j >= w[i]; j--) {
            if (dp[j - w[i]] + p[i] > dp[j]) {
                dp[j] = dp[j - w[i]] + p[i];
            }
        }
    }
    out << dp[G] << endl;
    return 0;
}