#include <cstdio>
using namespace std;

    typedef struct { int w,p; } box;

    int n,g,i,j;
    int R[10005];
    box T[10005];

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