#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

const int Gmax = 10001;

int main()
{
    int n, k;
    in >> n >> k;

    vector<int> d(Gmax);
    vector<int> p(n + 1), g(n + 1);

    for (int i = 1; i <= n; i++)
        in >> g[i] >> p[i];

    for (int i = 1; i <= n; i++)
        for (int j = k; j >= g[i]; j--)
            d[j] = max(d[j], d[j - g[i]] + p[i]);

    out << d[k];
    return 0;
}