Problem:
Score : 400 points

Problem Statement

You have N items and a bag of strength W.
The i-th item has a weight of w_i and a value of v_i.

You will select some of the items and put them in the bag.
Here, the total weight of the selected items needs to be at most W.

Your objective is to maximize the total value of the selected items.

Constraints

1 ≤ N ≤ 100

1 ≤ W ≤ 10^9

1 ≤ w_i ≤ 10^9

For each i = 2,3,...,N, w_1 ≤ w_i ≤ w_1 + 3.

1 ≤ v_i ≤ 10^7

W, each w_i and v_i are integers.

Input

Input is given from Standard Input in the following format:

N W
w_1 v_1
w_2 v_2
:
w_N v_N

Output

Print the maximum possible total value of the selected items.

Sample Input 1

4 6
2 1
3 4
4 10
3 4

Sample Output 1

11

The first and third items should be selected.

Sample Input 2

4 6
2 1
3 7
4 10
3 6

Sample Output 2

13

The second and fourth items should be selected.

Sample Input 3

4 10
1 100
1 100
1 100
1 100

Sample Output 3

400

You can take everything.

Sample Input 4

4 1
10 100
10 100
10 100
10 100

Sample Output 4

0

You can take nothing.

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for(ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
using ll = long long;
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

void print(const std::vector<int> &v) {
    std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
    std::cout << std::endl;
}
// https://emtubasa.hateblo.jp/entry/2018/11/24/000000
// dp[i]][j][k]
// i番目までの荷物の中でj個利用した時に総重量がkとなるような組み合わせの中で最大の値
ll dp[128][128][305];
// https://atcoder.jp/contests/abc060/submissions/3639903
int main() {
    int N;
    ll W;
    cin >> N >> W;
    vector<ll> weight(N);
    vector<ll> value(N);
    REP(i, N) { cin >> weight[i] >> value[i]; }
    // weight value
    ll ans = 0;
    ll fin = W / weight[0];
    ll finw = W % weight[0];
    ll fw = weight[0];
    for(int i = 0; i < N; i++) {
        weight[i] -= fw;
    }
    dp[0][1][0] = value[0];
    for(int i = 1; i < N; i++) {
        for(int j = 1; j <= i + 1; j++) {
            for(int k = 0; k <= 300; k++) {
                if(i == 0) {
                    continue;
                }
                dp[i][j][k] = dp[i - 1][j][k];
                if(k - weight[i] >= 0) {
                    dp[i][j][k] =
                        max(dp[i][j][k],
                            dp[i - 1][j - 1][k - weight[i]] + value[i]);
                }
            }
        }
    }

    for(int i = 0; i <= N + 1; i++) {
        for(int j = 0; j <= 304; j++) {
            if(fw * i + j > W) {
                continue;
            }
            ans = max(ans, dp[N - 1][i][j]);
        }
    }
    cout << ans << endl;
    return 0;
}