#include <iostream>
#include <fstream>

using namespace std;

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

int n, g, d[5002][10002], w[5002], p[5002];
/** d[i][j] = profitul maxim pe care il putem obtine cu o submultime a primelor i elemente cu
greutatea totala j */

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

    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j <= g; j++)
        {
            if (j-w[i] >= 0)
                d[i][j] = max(d[i-1][j], d[i-1][j-w[i]] + p[i]);
            else d[i][j] = d[i-1][j];
        }
    }
    fout << d[n][g];
    return 0;
}