#include <fstream>
#include <algorithm>
using namespace std;
#define N 5010
#define G 10010
ifstream in ("rucsac.in");
ofstream out ("rucsac.out");
int w[N],p[N],a[2][G];

int main()
{
    int n,g,i,j,k=0;
    in>>n>>g;
    for(i=1;i<=n;++i)
        in>>w[i]>>p[i];
    for(i=1;i<=n;++i)
    {
        for(j=0;j<=g;++j)
        {
            a[1-k][j]=a[k][j];
            if(w[i]<=j)
                a[1-k][j]=max(a[1-k][j],a[k][j-w[i]]+p[i]);
        }
        k=1-k;
    }
    out<<a[k][g]<<'\n';
    return 0;
}