/*
このコードを見ている皆さまへ(いないとおもうけど)

未定義動作には気をつけましょう.
ローカルとリモートで動作が違うと思ったら
範囲外アクセスの最適化による違いでした.

 */


#include<bits/stdc++.h>
using namespace std;using ll=long long;using vi=vector<int>;using vvi=vector<vi>;using vl=vector<ll>;using vvl=vector<vl>;using P=pair<int,int>;using PL=pair<ll,ll>;using vp=vector<P>;using vpl=vector<PL>;
template<typename T>constexpr auto inf=numeric_limits<T>::max()/2;constexpr int INF=inf<int>,MOD=1000000007;constexpr ll LINF=inf<ll>;
#define _ol3(_1,_2,_3,name,...)name
#define _rep(i,n)_repi(i,0,n)
#define _repi(i,a,b)for(int i=a,i##_l=(b);i<i##_l;++i)
#define REP(...)_ol3(__VA_ARGS__,_repi,_rep,)(__VA_ARGS__)
#define REPR(i,n)for(int i=n-1;i>=0;--i)
#define REPA(i,v)REP(i,(v).size())
#define all(v)(v).begin(),(v).end()
#define rall(v)(v).rbegin(),(v).rend()
#define bit(n)(1ll<<(n))
#define F first
#define S second
#define endl '\n'
#define cho(n,a,b)cout<<((n)?a:b)<<endl
void YES(int n){cho(n,"YES","NO");}void Yes(int n){cho(n,"Yes","No");}void Poss(int n){cho(n,"Possible","Impossible");}
void _print(ostream&){}template<class T,class...U>void _print(ostream&s,const T&t,const U&...u){s<<t<<(sizeof...(u)?' ':'\n');_print(s,u...);}
template<class...T>void print(const T&...t){_print(cout,t...);}template<class...T>void dprint(const T&...t){_print(cerr,t...);}
#ifndef LOCAL
struct osd{template<class T>osd&operator<<(const T&t){return*this;}};osd cer_;
#define dprint(...)
#define cerr cer_
#endif
template<class T>bool chmax(T&a,const T&b){bool x=a<b;x?a=b:b;return x;}template<class T>bool chmin(T&a,const T&b){bool x=a>b;x?a=b:b;return x;}
template<class T,class U>ostream&operator<<(ostream&o,const pair<T,U>&p){return o<<p.F<<' '<<p.S;}
template<class T,class U>istream&operator>>(istream&i,pair<T,U>&p){return i>>p.F>>p.S;}
template<class T>class iterable{static false_type c(string v);template<class U>static auto c(U v)->decltype(all(v),true_type());static false_type c(...);public:const static bool value=decltype(c(declval<T>()))::value;};
template<class T,typename=enable_if_t<iterable<T>::value>>ostream&operator<<(ostream&o,const T&v){for(auto&&i:v)o<<i<<' ';return o;}
template<class T>istream&operator>>(istream&i,vector<T>&v){for(T&j:v)i>>j;return i;}
template<class T>vector<T>&operator<<(vector<T>&v,const T&t){v.push_back(t);return v;}
template<class T>set<T>&operator<<(set<T>&v,const T&t){v.insert(t);return v;}
template<class T>multiset<T>&operator<<(multiset<T>&v,const T&t){v.insert(t);return v;}

int main(){
    cin.tie(0);ios::sync_with_stdio(0);
    ll n,w;
    cin>>n>>w;
    vpl a(n);
    cin>>a;
    ll mi=min_element(all(a))->F;
    vector<ll> c[4];
    REP(i,n){
        c[a[i].F-mi].push_back(a[i].S);
    }
    REP(i,4){
        sort(all(c[i]),greater<ll>());
        REP(j,1,c[i].size()){
            c[i][j]+=c[i][j-1];
        }
        c[i].insert(c[i].begin(), 0);
        dprint(i,':',c[i]);
    }
    ll ma=0;
    REP(i,c[0].size()){
        if((mi+0)*i>w)break;
        REP(j,c[1].size()){
            if((mi+0)*i+(mi+1)*j>w)break;
            REP(k,c[2].size()){
                if((mi+0)*i+(mi+1)*j+(mi+2)*k>w)break;
                REP(l,c[3].size()){
                    if((mi+0)*i+(mi+1)*j+(mi+2)*k+(mi+3)*l>w)break;
                    chmax(ma, c[0][i]+c[1][j]+c[2][k]+c[3][l]);
                }
            }
        }
    }
    cout<<ma<<endl;
}


Measured memory_bytes: 256