#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> values(N), weights(N);
for (int i = 0; i < N; ++i) {
cin >> values[i] >> weights[i];
}
vector<vector<int>> dp(N + 1, vector<int>(W + 1, 0));
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= W; ++j) {
if (weights[i - 1] <= j) {
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - weights[i - 1]] + values[i - 1]);
} else {
dp[i][j] = dp[i - 1][j];
}
}
}
cout << dp[N][W] << endl;
return 0;
}