#include <iostream>
#include <fstream>

using namespace std;

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

int n, g;
int w[10001], p[5001];
int dp[10001][10001];

int main()
{
    fin>>n>>g;
    for(int i=1; i<=n; i++)
        fin>>w[i]>>p[i];
    for(int i=1; i<=n; i++){
        int linc=i%2;
        int linant=1-linc;
        for(int j=0; j<=g; j++){
            dp[linc][j] = dp[linant][j];
            if(w[i]<=j)
                dp[linc][j] = max(dp[linant][j], dp[linant][j - w[i]] + p[i]);
        }
    }.
    fout<<dp[n%2][g];
    return 0;
}