#include <stdio.h>
#include <algorithm>
int d[2][10001];
int main()
{
    freopen("rucsac.in","r",stdin);
    freopen("rucsac.out","w",stdout);
    int n,q,l,g,i,j,p;
    scanf("%d%d",&n,&g);
    l=0;
    for(i=1;i<=n;i++,l=1-l)
    {
        scanf("%d%d",&q,&p);
        for(j=1;j<=g;j++)
            if(j<q)
            d[1-l][j]=d[l][j];
        else
            d[1-l][j]=std::max(d[l][j],d[l][j-q]+p);
    }
    printf("%d\n",d[l][g]);
    return 0;
}