#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

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

int n, w, wc, pc;
int dp[10013];

int main()
{
    fin >> n >> w;
    while (n--)
    {
        fin >> wc >> pc;
        for (int i = w; i >= wc; --i)
        {
            dp[i] = max(dp[i], dp[i - wc] + pc);
        }
    }
    fout << dp[w];
    return 0;
}