#include <fstream>
#include <vector>

short W[5005], P[5005];

std::vector<std::vector<int>> dp;

int main()
{
    std::ifstream f("rucsac.in");
    std::ofstream g("rucsac.out");
    int N, G, k = 0;

    f >> N >> G;
    for (int i = 0; i < N; ++i)
        f >> W[i] >> P[i];

    dp.resize(2, std::vector<int>(G + 1, 0));

    for (int i = 1; i <= N; ++i, k = 1 - k)
    {
        for (int j = 1; j <= G; ++j)
        {
            if (j - W[i - 1] >= 0)
                dp[k][j] = std::max(dp[1 - k][j], dp[1 - k][j - W[i - 1]] + P[i - 1]);
            else
                dp[k][j] = dp[1 - k][j];
        }
    }

    g << dp[1 - k][G];
}