#include <cstdio>
#include <algorithm>

using namespace std;
const int GMAX=1000000;
int d[GMAX+5];
int main()
{
    freopen("rucsac.in","r",stdin);
    freopen("rucsac.out","w",stdout);
    int n,i,j,last,g,p,gmax,pmax=0;
    scanf("%d%d",&n,&gmax);
    d[0]=0;
    last=0;
    for(i=1;i<=gmax;i++)
        d[i]=-1;
    for(i=1;i<=n;i++)
    {
        scanf("%d%d",&g,&p);
        for(j=last;j>=0;j--)
        {
            if(j+g>gmax)
                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=gmax;j>=0;j--)
        if(pmax<d[j])
            pmax=d[j];
    printf("%d",pmax);
    return 0;
}