#include <bits/stdc++.h>

using namespace std;

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

int dp[2][10005];
int profit[5005], greutate[5005];
int sumg, mx = INT_MIN, curr = 1;

int main() {
    int n, g; fin >> n >> g;
    for(int i = 1; i <= n; i++) {
        fin >> greutate[i] >> profit[i];
    }
    for(int i = 1; i <= n; i++) {
        sumg += greutate[i];
        for(int j = 0; j <= min(g, sumg); j++) {
            dp[curr][j] = 0;
            if(j-greutate[i] >= 0) {
                dp[curr][j] = max(dp[1-curr][j - greutate[i]] + profit[i], dp[1-curr][j]);
            } else {
                dp[curr][j] = dp[1-curr][j];
            }
        }
        curr = 1-curr;
    }
    for(int i = 0; i <= g; i++) {
        mx = max(mx, dp[n%2][i]);
    }
    fout << mx;
    return 0;
}