#include <cstdio>

int n,G,i,j,g,p,s[10005],maxim;

int main()
{
    freopen("rucsac.in","r",stdin);
    freopen("rucsac.out","w",stdout);
    scanf("%d%d",&n,&G);
    for (i=1; i<=G; i++) s[i]=-1;
    for (i=1; i<=n; i++)
    {
        scanf("%d%d",&g,&p);
        for (j=G-g; j>=0; j--)
            if (s[j]!=-1)
            if (s[j+g]<s[j]+p) s[j+g]=s[j]+p;
    }
    for (i=1; i<=G; i++)
        if (s[i]>maxim) maxim=s[i];
    printf("%d\n",maxim);
    return 0;
}