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