// Problema rucsacului - rezolvare cu matrice de costuri

#include <fstream>

using namespace std;

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

int a[5001][10001], g, n, i, j;
int w[5001], p[5001];

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

    for (i = 1; i <= n; i++)
        for (j = 1; j <= g; j++)
        {
            a[i][j] = a[i-1][j];
            if (w[i] <= j)  a[i][j] = max(a[i][j], a[i-1][j-w[i]] + p[i]);
        }

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