#include<cstdio>
#include<algorithm>
using namespace std;
int n,g,val,c,w,sol,a[10001],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,&c);
        for (j=g;j>=1;--j)
            if (a[j])
                if (j+w<=g)
                    if (a[j+w]<a[j]+c)
                        a[j+w]=a[j]+c,sol=max(sol,a[j+w]);
        a[w]=max(a[w],c);
    }
    printf("%d",sol);
    return 0;
}