#include <bits/stdc++.h>

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

int n, g, ans;

int w[5005];
int p[5005];

int dp[5005][10005];

int main() {
    fin >> n >> g;
    for (int i = 1; i <= n; i++) {
        fin >> w[i] >> p[i];
    }

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

    fout << ans;
    return 0;
}