#include <fstream>


using namespace std;
int n,G,dp[10001],g[5001],p[5001];
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main(){
    fin>>n>>G;
    for(int i=1;i<=n;i++)
        fin>>g[i]>>p[i];
    /// dp[i] = pretul maxim pentru a ajunge
    /// la greutatea i
    for(int i=1;i<=n;i++){
        for(int j = G-g[i];j>=0;j--){
            dp[j+g[i]]= max(dp[j+g[i]],dp[j]+p[i]);
        }
    }
    int sol = 0;
    for(int j=G;j>=0;j--)
        sol = max(sol,dp[j]);
    fout<<sol;
    return 0;
}