#include<cstdio>
#include<algorithm>
using namespace std;
#define BM 5005
#define GM 10005
#define mare -99999999
int n,c,mx;
int w[BM],p[BM];
int d[GM];
int main () {
    int i,j;
    freopen("rucsac.in","r",stdin);
    freopen("rucsac.out","w",stdout);
    scanf("%d %d",&n,&c);
    for(i=1;i<=n;++i)scanf("%d %d",&w[i],&p[i]);
    for(i=1;i<=GM-5;++i)d[i]=mare;
    for(i=1;i<=n;++i){
        for(j=GM-5;j>=0;--j){
            if(d[j]!=mare&&j+w[i]<=GM-5){
                d[j+w[i]]=max(d[j+w[i]],d[j]+p[i]);
            }
        }
    }
    for(i=1;i<=c;++i)mx=max(mx,d[i]);
    printf("%d",mx);
    return 0;
}