#include <bits/stdc++.h>

using namespace std;


int main() {
    ifstream cin("rucsac.in");
    ofstream cout("rucsac.out");
    int n, g;
    cin >> n >> g;
    vector<pair<int, int>>a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i].first >> a[i].second;
    }

    sort(a.begin(), a.end(), [&] (const pair<int, int>&L, const pair<int, int>&R) {
        return (long double)L.second / L.first > (long double)R.second / R.first;
    });
    vector<int>sum(n);
    for(int i = 0; i < n; ++i) {
        sum[i] = a[i].first;
        if(i) sum[i] += sum[i - 1];
    }
    auto sumq = [&] (int i, int j) {
        return sum[i] - j ? sum[j - 1] : 0;
    };
    auto at_most = [&] (int pos, int rem) {
        int rb = pos;
        int got = 0;
        for(int k = 12; k >= 0; k--)
            if(rb + (1 << k) < n && sumq(pos, rb + (1 << k)) <= rem)
                rb += 1 << k;
        rem -= sumq(pos, rb);
        got = sumq(pos, rb);
        rb++;
        if(rb < n) {
            double take = (double)rem / a[rb].first;
            got += take * a[rb].second;
            got++;
        }
        return got;
    };
    int global_max = -1;
    function<void(int, int, int)>bkt = [&] (int pos, int rem, int got) {
        if(pos == n) {
            global_max = max(global_max, got);
            return;
        }


        if(rem - a[pos].first >= 0 && got + at_most(pos + 1, rem - a[pos].first) + a[pos].second > global_max)
            bkt(pos + 1, rem - a[pos].first, got + a[pos].second);
        if(got + at_most(pos + 1, rem) > global_max)
            bkt(pos + 1, rem, got);

    };

    bkt(0, g, 0);
    cout << global_max;
}