#include <fstream>
using namespace std;

ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int w[5002], p[5002];
int optim[2][10002];
int main()
{
    int n, g, i, j;
    cin >> n >> g;
    for (i = 1; i <= n; ++i)
        cin >> w[i] >> p[i];
    int l = 0;
    for (i = 1; i <= n; ++i, l = 1 - l)
        for (j = 0; j <= g; ++j) {
            optim[1 - l][j] = optim[l][j];
            if (w[i] <= j) {
                optim[1 - l][j] = max(optim[1 - l][j], optim[l][j - w[i]] + p[i]);
            }
        }
    cout << optim[l][g];
    return 0;
}