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