#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

int main() {
    int n, G;
    fin >> n >> G;
    vector<int> g(n + 1);
    vector<int> p(n + 1);
    vector<vector<int>> dp(n + 1, vector<int>(G + 1, 0));

    for (int i = 1; i <= n; i++) {
        fin >> g[i] >> p[i];
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= G; j++) {
            if (j >= g[i])
                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - g[i]] + p[i]);
            else 
                dp[i][j] = dp[i - 1][j];
        }
    }
    fout << dp[n][G] << '\n';
    return 0;
}