#include <bits/stdc++.h>
using namespace std;

int rucasc(int n, int W, vector<int> &w, vector<int> &p) {
    vector<int> dp(W + 1, 0);

    for (int i = 1; i <= n; i++) 
        for (int cap = W; cap >= w[i]; cap--) 
            dp[cap] = max(dp[cap], dp[cap - w[i]] + p[i]);

    return dp[W];
}


int main() {

    ifstream in("rucsac.in");
    ofstream out("rucsac.out");
    int n, W;
    in >> n >> W;
    vector<int> w(n + 1), p(n + 1);

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

    out << rucasc(n, W, w, p) << endl;
    return 0;
}