#include <iostream>
#include <fstream>

using namespace std;
ifstream fin  ("energii.in");
ofstream fout ("energii.out");
int w[5003], wp[1003], c[1003];
int main()
{
    int n, W;
    fin >> n >> W;
    for(int i = 1; i <= n; i++)
    {
        fin >> wp[i] >> c[i];
    }
    for(int i = 1; i <= n; i++)
    {
        for(int j = W; j >= 0; j--)
        {
            if(j - wp[i] >= 0)
            w[j] = max(w[j], w[j-wp[i]] + c[i]);
            //cout << w[j] << ' ';
        }
        //cout << endl;
    }
    fout << w[W];
    return 0;
}