#include <fstream>
#include <vector>

short W[5005], P[5005];

std::vector<int> dp;

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

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

    dp.resize(G + 1, 0);

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