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