#include <fstream>
using namespace std;

ifstream cin("rucsac.in");
ofstream cout("rucsac.out");

const int N = 1005, W = 100005;
int n, w;
int weight[N], value[N];
int dp[N][W];

int knapsack() {
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= w; j++) {
            if (i == 0 || j == 0) {
                dp[i][j] = 0;
            } else if (weight[i - 1] <= j) {
                dp[i][j] = max(value[i - 1] + dp[i - 1][j - weight[i - 1]], dp[i - 1][j]);
            } else {
                dp[i][j] = dp[i - 1][j];
            }
        }
    }
    return dp[n][w];
}

int main() {
    cin >> n >> w;
    for (int i = 0; i < n; i++) {
        cin >> weight[i] >> value[i];
    }
    cout << knapsack() << endl;
    return 0;
}