#include <fstream>
#include <vector>

using namespace std;

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

typedef pair<int, int> pi;

const int NMAX = 5001;
const int GMAX = 1e4 + 1;

long long dp[NMAX][GMAX];

int n, g, a, b;

vector<pi> v;

int main()
{
    fin >> n >> g;
    v.push_back({0, 0});
    for (int i = 1; i <= n; ++i)
    {
        fin >> a >> b;
        v.push_back({a, b});
    }

    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= g; ++j)
        {
            dp[i][j] = dp[i - 1][j];
            if (j >= v[i].first)
                dp[i][j] = max(dp[i][j], dp[i - 1][j - v[i].first] + v[i].second);
        }
    }

    fout << dp[n][g] << '\n';

    return 0;
}