#include <fstream>
#include <algorithm>
using namespace std;
const int GMAX=10000;
int d[GMAX+5];
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main()
{
    int n,i,j,g,p,last,G,pmax=0;
    fin>>n>>G;
    d[0]=0;
    last=0;
    for(i=1;i<=G;i++)
        d[i]=-1;
    for(i=1;i<=n;i++)
    {
        fin>>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];
    fout<<pmax;
    return 0;
}