#include <bits/stdc++.h>
using namespace std;

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

int W[5001] , P[5001] , best[10001] , N , max_W ;

void read_input ()
{
    in >> N >> max_W;
    for(int i = 1 ; i <= N ; ++ i)
        in >> W[i] >> P[i];
}

void solve ()
{
    int Max = 0;
    for(int i = 1 ; i <= N ; ++i)
    {
        for(int j = max_W - W[i] ; j >= 0 ; -- j)
        {
            if(best[j + W[i]] < best[j] + P[i])
            {
                best[j + W[i]] = best[j] + P[i];
               if(best[j + W[i]] > Max)
                    Max = best[j + W[i]];
            }
        }
    }

    out << Max;
}

int main()
{
    read_input ();
    solve ();
    return 0;
}