#include <stdio.h>
using namespace std;
int n,m,i,j,k,g[10001],p[10001],sol[10001];
inline int maxx(int a,int b)
{
    if (a>b) return a; else return b;
}
int main(){
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++) scanf("%d%d",&g[i],&p[i]);
for (i=1;i<=n;i++){
    for (j=m;j>=g[i];j--)
        sol[j]=maxx(sol[j],sol[j-g[i]]+p[i]);
}
int max=0;
for (i=1;i<=m;i++)
    if (sol[i]>max) max=sol[i];
printf("%d\n",max);
return 0;
}