#include <iostream>
#include <fstream>
#define dm 10005
#define DM 5005
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int gr[DM];
int prof[DM];
int n, g, cl;
int dp[2][dm];
int main()
{
    fin >> n >> g;
    for(int  i = 1; i <= n ; i++)
        fin >> gr[i] >> prof[i];
    for(int i = 1; i <= n; i++){
        cl = i % 2;
        for(int  j = 1; j <= g; j++)
        {
            dp[cl][j] = dp[1-cl][j];
            if(gr[i] <= j)
            dp[cl][j] = max(dp[1-cl][j], dp[1-cl][j - gr[i]] + prof[i]);
        }

    }

    fout << dp[n%2][g];
    return 0;
}