#include <fstream>
#define maxn 5001
#define maxg 10005
using namespace std;

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

int n, g;
int rucsac[maxn][maxg];

int w[maxn], p[maxn];

int main()
{
    fin >> n >> g;

    for(int i = 1; i <= n; ++i)
    {
        fin >> w[i] >> p[i];
    }

    for(int i = 0; i <= n; ++i)
    {
        for(int j = 0; j <= g; ++j)
        {
            if(i == 0 || j == 0)
            {
                rucsac[i][j] = 0;
            }
            else if(w[i] <= j)
            {
                rucsac[i][j] = max(rucsac[i - 1][j], rucsac[i - 1][j - w[i]] + p[i]);
            }
            else rucsac[i][j] = rucsac[i - 1][j];
        }
    }

    fout << rucsac[n][g];
    return 0;
}