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

#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <queue>
#include <stack>

using namespace std;

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

typedef long long ll;

void Solve() {
    int n, g;
    fin >> n >> g;
    vector<vector<int>> dp(2, vector<int>(g + 1));
    vector<int> w(n+1), p(n+1);
    for (int i = 1; i <= n; ++i) {
        fin >> w[i] >> p[i];
    }

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= g; ++j) {
            dp[1][j] = dp[0][j];
            if (j - w[i] >= 0) {
                dp[1][j] = max(dp[1][j], dp[0][j - w[i]] + p[i]);
            }
        }
        dp[0] = dp[1];
    }

    fout << dp[1][g] << '\n';
}

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    Solve();
    return 0;
}