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

int dp[5005][10005], n, g, w[5005], p[5005];

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

void citire() {
    fin >> n >> g;
    for(int i = 1; i <= n; i++)
        fin >> w[i] >> p[i];
}

void solve() {
    for(int i = 1; i <= n; i++)
        for(int cw = 0; cw <= g; cw++) {
            dp[i][cw] = dp[i-1][cw];
            if(w[i] <= cw)
                dp[i][cw] = max(dp[i][cw], dp[i-1][cw-w[i]]+p[i]);
        }
}

int main() {
    citire();
    solve();
    fout << dp[n][g];
}