#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

int w[5001],p[5001],d[5001][5001];

int main()
{
    int n,g;
    fin>>n>>g;
    for(int i=1;i<=n;++i)
    {
        fin>>w[i];
        fin>>p[i];
    }
    for(int i=1;i<=n;++i)
        for(int j=0;j<=g;++j)
        {
            d[i][j] = d[i-1][j];
            if(w[i] <= j)
                 d[i][j] = max(d[i][j], d[i - 1][j - w[i]] + p[i]);
        }
    fout<<d[n][g];
    return 0;
}