#include <fstream>

using namespace std;
 ifstream f("rucsac.in");
    ofstream g("rucsac.out");
int i,n,W[10004],P[10002],a[2][5010],G,j;
int main()
{

   f >> n >> G;
    for(int i=1;i<=n;i++){
        f>>W[i]>>P[i];
    }

  for(i=1; i<=n; i++)
    {
        for(j=1; j<=G; j++)
        {
            a[1][j] = a[0][j];
            if (W[i] <= j)
                a[1][j] = max(a[0][j], a[0][j-W[i]] + P[i]);
        }
        for(j=1; j<=G; j++)
            a[0][j] = a[1][j];
    }
    g<<a[1][G];

    return 0;
}