#include <fstream>
#include <algorithm>

using namespace std;

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

const int maxn = 5010;

int n, g, p[maxn], w[maxn], dp[2][2 * maxn];

int main()
{
    fin >> n >> g;
    for (int i = 1; i <= n; i++)
        fin >> w[i] >> p[i];
    int l = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int cw = 0; cw <= g; cw++)
        {
            dp[1 - l][cw] = dp[l][cw];
            if (w[i] <= cw)
                dp[1 - l][cw] = max(dp[1 - l][cw], dp[l][cw - w[i]] + p[i]);
        }
        l = 1 - l;
    }
    fout << dp[l][g];
    return 0;
}