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

using namespace std;

int main() {
    int N, G;
    ifstream fin("rucsac.in");
    ofstream fout("rucsac.out");
    fin >> N >> G;
    vector<int> w(N), p(N);
    vector<int> dp(G + 1, 0);
    for (int i = 0; i < N; i++) {
        fin >> w[i] >> p[i];
    }
    for (int i = 0; i < N; i++) {
        for (int j = G; j >= w[i]; j--) {
            dp[j] = max(dp[j], dp[j - w[i]] + p[i]);
        }
    }
    fout << dp[G] << endl;
    return 0;
}