#include <fstream>
#include <vector>

using namespace std;

int main()
{
    ifstream in("rucsac.in");
    ofstream out("rucsac.out");
    int n, k;
    in >> n >> k;
    vector <int> g(n), p(n);
    for (int i = 0; i < n; i++)
    {
        in >> g[i] >> p[i];
    }
    vector <int> profit(k + 1, -1);
    profit[0] = 0;
    for (int i = 0; i < n; i++)
    {
        for (int j = k; j >= g[i]; j--)
        {
            if (profit[j-g[i]] != -1)
            {
                profit[j] = max(profit[j], profit[j-g[i]] + p[i]);
            }
        }
    }
    int profit_max = -1;
    for (auto pr: profit)
    {
        profit_max = max(profit_max, pr);
    }
    out << profit_max << "\n";
    in.close();
    out.close();
    return 0;
}