#include <iostream>
#include <fstream>
using namespace std;

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

int m[5010][10010];
int main()
{
    int n, g;
    fin>>n>>g;

    for(int i = 1; i <= n; i++){
        int w, p;
        fin>>w>>p;
        for(int j = 1; j <= g; j++){
            m[i][j] = m[i-1][j];
            if(j >= w){
                m[i][j] = max(m[i-1][j], m[i-1][j-w] + p);
            }
        }
    }

    fout<<m[n][g];
    return 0;
}