#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define sim template < class c
#define int long long
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << '\n'; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
typedef tree< pair<int,int>, null_type, less<pair<int,int> >, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
const ll MOD = 1e9 + 7 ;
const ll N = 2e5 + 10 ;
const ll INF = 1e18 + 10 ;
signed main(){
    fastio
    int n , W ;
    cin >> n >> W ; 
    vector<vector<int> > v(4) ;
    int weight = 0 ; 
    for(int i = 0; i < n; i++){
        int w , x ;
        cin >> w >> x ;
        if ( i == 0 ) {
            v[0].push_back(x) ;
            weight = w ;
        }
        else v[w - weight].push_back(x) ;
    }
    for(int i = 0; i < 4; i++){
        sort(v[i].rbegin(), v[i].rend()) ;
    }
    vector<int> A((int)v[0].size() + 1) ;
    int a = (int) A.size() ;
    vector<int> B((int)v[1].size() + 1) ;
    int b = (int) B.size() ;
    vector<int> C((int)v[2].size() + 1) ;
    int c = (int) C.size() ;
    vector<int> D((int)v[3].size() + 1) ;
    int d = (int) D.size() ;
    for(int i = 1; i < a; i++){
        A[i] = A[i - 1] + v[0][i - 1] ;
    }
    for(int i = 1; i < b; i++){
        B[i] = B[i - 1] + v[1][i - 1] ;
    }
    for(int i = 1; i < c; i++){
        C[i] = C[i - 1] + v[2][i - 1] ;
    }
    for(int i = 1; i < d; i++){
        D[i] = D[i - 1] + v[3][i - 1] ;
    }
    debug() << imie(A) ;
    debug() << imie(B) ;
    debug() << imie(C) ;
    debug() << imie(D) ;
    int answer = 0 ; 
    debug() << imie(weight) ;
    for(int i = 0; i < a; i++){
        int cur = weight * i ;
        for(int j = 0; j < b; j++){
            int tt = cur + weight * j + j ;
            debug() << imie(i) imie(j) imie(cur) ;
            for(int k = 0; k < c; k++){
                int cc = tt + weight * k + k * 2 ;
                for(int u = 0; u < d; u++){
                    int pp = cc + weight * u + u * 3 ;
                    if ( pp <= W ){
                        answer = max(answer, A[i] + B[j] + C[k] + D[u]) ;
                        debug() << imie(i) imie(j) imie(k) imie(u) imie(answer);
                    }
                }
            }
        }
    }
    cout << answer << endl ;
    return 0; 
}

Measured memory_bytes: 3552