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