#include <bits/stdc++.h>
using namespace std;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    long long N,M; cin >> N >> M;
    vector<pair<long long,long long>> CD(N);
    for(auto &[c,d] : CD) cin >> c >> d;
    sort(CD.rbegin(),CD.rend());
    long long add = 0;
    while(CD.size()){
        auto [c,d] = CD.back();
        if(c == 0) add += d,CD.pop_back();
        else break;
    }
    if(24*M >= 50000000){
        vector<map<int,long long>> dp(24);
        dp.at(0)[0] = 0;
        for(auto [c,d] : CD){
            c <<= 22;
            for(int i=22; i>=0; i--,c>>=1) for(auto [k,v] : dp.at(i)){
                if(k+c > M) break;
                dp.at(i+1)[k+c] = max(dp.at(i+1)[k+c],dp.at(i).at(k)+d);
            }
        }
        long long ans = 0;
        for(auto &M : dp) for(auto [k,v] : M) ans = max(ans,v); 
        ans += add;
        cout << ans << endl; return 0;
    }
    
    long long inf = 1e18;
    vector dp(24,vector(M+1,-inf));
    dp.at(0).at(0) = 0;
    for(auto [c,d] : CD){
        c <<= 22;
        for(long long i=22; i>=0; i--,c>>=1) for(long long k=0; ; k++){
            if(k+c > M) break;
            if(dp.at(i).at(k) == inf) continue;
            dp.at(i+1).at(k+c) = max(dp.at(i+1).at(k+c),dp.at(i).at(k)+d);
        }
    }

    long long answer = 0;
    for(auto &d : dp) for(auto v : d) answer = max(answer,v);
    answer += add;
    cout << answer << endl;
}