#include<stdio.h>
#include<algorithm>
#include<cstring>
#define maxn 5005
#define maxg 10005
using namespace std;

int n,g;
int w[maxn],p[maxn];
int s[2][maxg];

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

void solve()
{
    int i,j;

    for(i=1;i<=n;i++)
    {
        for(j=0;j<=g;j++)
        {
            s[1][j]=s[0][j];
            if(j-w[i]>=0 && s[1][j]<s[0][j-w[i]]+p[i])
             s[1][j]=s[0][j-w[i]]+p[i];
        }
        memcpy(s[0],s[1],sizeof(s[1]));
    }
}

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

    read();
    solve();
    printf("%d",s[1][g]);

    fclose(stdin);
    fclose(stdout);
    return 0;
}