#include <iostream>
#include <fstream>
using namespace std;
int n,i,g,d[2][10010],w[5010],p[5010],j,l;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int main()
{
    in>>n>>g;
    for (i=1;i<=n;i++)
    {
        in>>w[i]>>p[i];
    }
    l=0;
    for (i=1;i<=n;i++,l=1-l)
        for (j=0;j<=g;j++)
    {
        d[1-l][j]=d[l][j];
        if (w[i]<=j)
            d[1-l][j]=max(d[1-l][j],d[l][j-w[i]]+p[i]);
    }
    out<<d[l][g];
}