#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const int INF = 2e9 + 10;
const ll inf = 1e18 + 10;
ll dp[101][100001];
int N, W;
vector<ll> v(101);
vector<ll> w(101);
ll rec(int at, ll remaining_weight) {
    if(at == N) {
        return 0;
    }
    if(remaining_weight == 0) {
        return 0;
    }
    if(dp[at][remaining_weight] != -1) {
        return dp[at][remaining_weight];
    }
    ll ret = -inf;
    ret = max(ret, rec(at + 1, remaining_weight));
    if(remaining_weight - w[at] >= 0) {
        ret = max(ret, rec(at + 1, remaining_weight - w[at]) + v[at]);
    }
    dp[at][remaining_weight] = ret;
    return ret;
}
int main() {
    cin >> N;
     cin >> W;
    for (int i = 0; i < N; i++) {
        cin >> w[i];
        cin >> v[i];
    }
    for(int i = 0; i < N; ++i) {
        for(int j = 0; j <= W; ++j) {
            dp[i][j] = -1;
        }
    }
    cout << rec(0, W) << endl;
    return 0;
}