#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int a[10004],b[10004],n,g,w[5002],p[5002],i,j;
int main()
{
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 (j=1;j<=g;j++)
    if (w[i]>j) b[j]=a[j];
           else b[j]=max(a[j],a[j-w[i]]+p[i]);
    memcpy(a,b,sizeof(b));
    }
printf("%d",b[g]);
}