#include <iostream>
#include <fstream>

using namespace std;

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

constexpr int NMAX = 5010, GMAX = 10010;

int w[NMAX], p[NMAX], dp[NMAX][GMAX];

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

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

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= g; j++)
        {
            dp[i][j] = dp[i - 1][j]; // presupunem ca nu adaugam

            if (j >= w[i])
                dp[i][j] = max(dp[i][j], dp[i - 1][j - w[i]] + p[i]); // maximul dintre daca nu adaugam elementul actual si daca il adaugam la solutia cu maxim j - w[i]
        }
    }

    fout << dp[n][g];
}