#include <algorithm>
#include <iostream>
#include <utility>
#include <iomanip>
#include <fstream>
#include <climits>
#include <vector>
#include <stack>
#include <cmath>

using namespace std;

#define MAXN 5010
#define MAXG 10010

int N, G;
int DP[2][MAXG];
int W[MAXN], V[MAXN];

int main() {
    
    ifstream  cin("rucsac.in");
    ofstream cout("rucsac.out");
    
    cin >> N >> G;
    
    for (int i = 1; i <= N; ++i) {
        cin >> W[i] >> V[i];
    }
    
    
    for (int i = 1; i <= N; ++i) {
        for (int cw = 0; cw <= G; ++cw) {
            
            if (W[i] <= cw) {
                DP[1][cw] = max(DP[0][cw], DP[0][cw - W[i]] + V[i]);
            } else {
                DP[1][cw] = DP[0][cw];
            }
            
        }
        
        for (int cw = 0; cw <= G; ++cw) {
            DP[0][cw] = DP[1][cw];
        }
    }
    
    cout << DP[1][G] << "\n";
    
    cin.close();
    cout.close();
    
    return 0;
}