#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

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

    int n, W;
    fin >> n >> W;

    vector<int> greutate(n), valoare(n);
    for (int i = 0; i < n; i++)
        fin >> greutate[i] >> valoare[i];

    vector<int> dp(W + 1, 0);

    for (int i = 0; i < n; i++) {
        for (int w = W; w >= greutate[i]; w--) {
            dp[w] = max(dp[w], dp[w - greutate[i]] + valoare[i]);
        }
    }

    fout << dp[W] << endl;

    return 0;
}