#include <iostream>
#include <fstream>


using namespace std;

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

int gr[50005] , p[50005] , maxim , n , gmax , a[50005];

int main()
{
    f >> n >> gmax;
    for (int i = 1 ; i <= n ; i++)
        f >> gr[i] >> p[i];
    for (int i = 1 ; i <= n ; i++)
    {
        for (int j = gmax - gr[i] ; j >= 0 ; j--)
        {
            if (a[j + gr[i]] < a[j] + p[i])
                a[j + gr[i]] = a[j] + p[i];
            if (a[j + gr[i]] > maxim)
                maxim = a[j + gr[i]];
        }
    }
    g << maxim;


    return 0;
}