#include<fstream>
using namespace std;
long n,i,d[10001],w[5001],p[5001],j,G;
long maxim(long a, long b)
    {
        if(a>b)
            return a;
        return b;
    }
int main()
{
    ifstream f("rucsac.in");
    ofstream g("rucsac.out");
 f>>n>>G;
 for(i=1;i<=n;i++)
    {f>>w[i]>>p[i];
    if(i>=w[i])
        d[i]=p[1];
    }
 for(i=2;i<=n;i++)
    for(j=G;j>=1;j--)
        {
            d[j]=maxim(d[j], d[j-w[i]]+p[i]);
        }
 g<<d[G];
 return 0;

}