#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,m,x,y,i,a[10001],b[10001],j;
int main()
{
    f>>n>>m;
    for(i=0;i<=m;i++) a[i]=0;
    a[0]=1;
    for(j=0;j<=m;j++) b[i]=0;
    for(i=1;i<=n;i++)
        {
            f>>x>>y;
            for(j=m;j>=0;j--) if(a[j]==1)
            {
                a[j+x]=1;
                b[j+x]=max(b[j+x],b[j]+y);
            }
        }
        sort(b+1,b+m+1);
    g<<b[m];
    return 0;
}