#include <fstream>
#include <algorithm>

using namespace std;
const int NMAX=10000;
int d[NMAX+5];
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main()
{
    int n,G,i,g,p,last,ans,j;
    fin>>n>>G;
    for(i=1;i<=G;i++)
        d[i]=-1;
    last=0;
    for(i=1;i<=n;i++)
    {
        fin>>g>>p;
        for(j=last;j>=0;j--)
        {
            if(d[j]!=-1)
            {
                if(j+g>G)
                continue;
            if(d[j]+p>d[j+g])
                d[j+g]=d[j]+p;
            if(j+g>last)
                last=j+g;
            }
        }
    }
    ans=0;
    for(i=G;i>=1;i--)
    {
        if(d[i]>ans)
            ans=d[i];
    }
    fout<<ans;
    return 0;
}