/* 
 * File:   Problemarucsacului.cpp
 * Author: slycer
 *
 * Created on December 24, 2011, 10:02 PM
 */

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

/*
 * 
 */
int main(int argc, char** argv) {
    
    ifstream input ("rucsac.in");
    ofstream output ("rucsac.out");
    int n,m;
    input >> n >> m; 
    int dp[m+1];
    for ( int i=0; i<=m; i++){
        dp[i] = 0; 
    }
    int sol=0; 
    for ( int i=0; i<n; i++){
        int w,p;
        input >> w >> p;
        for ( int j=m; j-w>=0; j-- ){
            dp[j] = max(dp[j-w]+p, dp[j]);
            sol = max(sol,dp[j]);
        }
        //cout << w << " " << p << " " << endl; 
    }
    output << sol; 
    
    return 0;
}