#include <fstream>
#include <vector>
using namespace std;

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

const int n_Max = 5001;
const int G_Max = 10001;

int n, G, g[n_Max], v[n_Max], dp[n_Max][G_Max];

int main()
{
    fin >> n >> G;
    for (int i = 1; i <= n; ++i)
        fin >> g[i] >> v[i];

    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= G; ++j)
            if (g[i] > j)
                dp[i][j] = dp[i - 1][j];
            else
                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - g[i]] + v[i]);

    fout << dp[n][G];

    return 0;
}