#include <cstdio>
#include <algorithm>
using namespace std;
const int NMAX=10000;
int d[NMAX+5];
int main()
{
    freopen("rucsac.in","r",stdin);
    freopen("rucsac.out","w",stdout);
    int n,i,j,g,p,gmax,last,maxp;
    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(d[j]!=-1 and j+g<=gmax)
            {
                d[j+g]=d[j]+p;
                if(j+g>last)
                    last=j+g;
            }
    }
    maxp=0;
    for(i=1;i<=gmax;i++)
        maxp=max(maxp,d[i]);
    printf("%d",maxp);
    return 0;
}