#include <iostream>
#include <fstream>

using namespace std;

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

int n, g;
int dp[5][100005];

int main()
{
    in >> n >> g;
    for (int i = 0; i <= n; i++)
    {
        int w, p;
        in >> w >> p;
        for (int j = 0; j <= g; j++)
        {
            if (j >= w)
                dp[i % 2][j] = max(dp[1 - i % 2][j], dp[1 - i % 2][j - w] + p);
            else dp[i % 2][j] = dp[1 - i % 2][j];
        }
    }
    out << dp[n % 2][g];
    return 0;
}