#include <fstream>

using namespace std;

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

int a[2][10001], w[5001], p[5001];

int main()
{
    int n, G;
    in >> n >> G;
    for (int i = 1; i <= n; ++i)
        in >> w[i] >> p[i];
    int l = 0;
    for (int i = 1; i <= n; ++i, l = 1 - l)
    {
        for (int j = 1; j <= G; ++j)
        {
            a[1 - l][j] = a[l][j];
            if (w[i] <= j)
                a[1 - l][j] = max(a[l][j], a[l][j - w[i]] + p[i]);
        }
    }
    out << a[l][G];
    return 0;
}