#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("rucsac.in");
ofstream g ("rucsac.out");
const int GMAX = 10001;
int maxProfit[GMAX]; ///maxProfit[i] - profitul maxim pe care putem sa il obtinem avand greutatea i
int main()
{
    int n, gMax, ans = 0;
    f >> n >> gMax;
    for (int i = 1; i <= n; i++)
    {
        int weight, profit;
        f >> weight >> profit;
        for (int w = gMax; w >= weight; w--)
        {
            int crtProfit = maxProfit[w - weight] + profit;///vedem ce am obtine daca adaugam obiectul curent in rucsac
            maxProfit[w] = max (maxProfit[w], crtProfit);
            ans = max (ans, maxProfit[w]);
        }
    }
    g << ans;
    return 0;
}