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