#include<cstdio>
#include<algorithm>
using namespace std;
int d[10001],g[5001],p[5001];
int main()
{
    freopen("rucsac.in","r",stdin);
    freopen("rucsac.out","w",stdout);
    int n,i,smax=0,gmax,maxr=0,j;
    scanf("%d%d",&n,&gmax);
    for(i=1;i<=n;i++)
        scanf("%d%d",&g[i],&p[i]);
    d[0]=0;
    for(i=1;i<=gmax;i++)
        d[i]=-1;
    for(i=1;i<=n;i++)
        {
        for(j=smax;j>=0;j--)
            if (j+g[i]<=gmax)
                {
                d[j+g[i]]=max(d[j+g[i]],d[j]+p[i]);
                if (j+g[i]>smax)
                    smax=j+g[i];
                }
        }
    for(i=0;i<=gmax;i++)
        if (maxr<d[i])
            maxr=d[i];
    printf("%d\n",maxr);
return 0;
}