#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int P[2][10005];

int g[5005];
int p[5000];

int main()
{
    freopen("rucsac.in","r",stdin);
    freopen("rucsac.out","w",stdout);

    int n,G;
    int i;
    scanf("%d%d",&n,&G);
    for(i=1;i<=n;++i)
        scanf("%d%d",&g[i],&p[i]);

    int j;
    for(i=1;i<=n;++i)
    {
        memcpy(P[0],P[1],sizeof(P[1]));
        for(j=g[i];j<=G;++j)
                P[1][j]=max(P[0][j],P[0][j-g[i]]+p[i]);
    }
    printf("%d\n",P[1][G]);

    return 0;
}