#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,w[10001],p[10001],pd[10001][5001];
int main()
{
    f>>n>>G;
    for(int i=1;i<=n;i++)
        f>>w[i]>>p[i];
    for(int i=1;i<=n;i++)
        for(int j=0;j<=G;j++)
        {
            pd[i][j]=pd[i-1][j];
            if(w[i]<=j)
                pd[i][j]=max(pd[i][j],pd[i-1][j-w[i]]+p[i]);
        }
    g<<pd[n][G]<<'\n';
    g.close();
    return 0;
}