#include <fstream>
#include <algorithm>

using namespace std;
const int gmax=100000;
int d[gmax+5];
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int main()
{
    int n,i,j,last,g,p,pmax=0,G;
    cin>>n>>G;
    d[0]=0;
    last=0;
    for(i=1;i<=G;i++)
        d[i]=-1;
    for(i=1;i<=n;i++)
    {
        cin>>g>>p;
        for(j=last;j>=0;j--)
        {
            if(j+g>G)
                continue;
            if(d[j]!=-1)
                if(d[j]+p>d[j+g])
            {
                d[j+g]=d[j]+p;
                last=max(last,j+g);
            }
        }
    }
    for(j=G;j>=0;j--)
            if(d[j]>pmax)
            pmax=d[j];
    cout<<pmax;

    return 0;
}