#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <fstream>

using namespace std;

int main() {
    int N, G;
    ifstream fin("rucsac.in");
    ofstream fout("rucsac.out");
    fin >> N >> G;
    vector<int> w(N), p(N);
    vector<vector<int>> dp(N + 1, vector<int> (G + 1, 0));
    for (int i = 0; i < N; i++) {
        fin >> w[i] >> p[i];
    }
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= G; j++) {
            if (w[i] <= j) {
                dp[i][j] = max(dp[i - 1][j], dp[i-1][j - w[i]] + p[i]); 
            }
            else {
                dp[i][j] = dp[i - 1][j];
            }
        }
    }
    fout << dp[N][G] << endl;
    return 0;
}