#include <cstdio>

using namespace std;

int d[3][10005],w[5005],p[5005];
int n,g;

void citire()
{
    scanf("%d%d",&n,&g);
    for(int i=1;i<=n;i++)
        scanf("%d%d",&w[i],&p[i]);
}

int non(int pz)
{
    if(pz==0)
        return 1;
    return 0;
}

int maxim(int a,int b)
{
    if(a>b)
        return a;
    return b;
}

void rezolv()
{
    int pz=1,npz;
    for(int i=1;i<=n;i++)
    {
        npz=pz;
        pz=non(pz);
        for(int j=1;j<=g;j++)
        {
            if(w[i]>j)
                d[pz][j]=d[npz][j];
            else
                d[pz][j]=maxim(d[npz][j],d[npz][j-w[i]]+p[i]);
        }
    }
    printf("%d",d[pz][g]);
}

int main()
{
    freopen("rucsac.in","r",stdin);
    freopen("rucsac.out","w",stdout);
    citire();
    rezolv();
    return 0;
}