#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

ll op(ll a, ll b){
    return a + b;
}

ll e(){
    return 0LL;
}

ll target;

bool f(ll x){
    return x <= target;
}

int main() {
    ll N;
    cin >> N;
    ll B;
    cin >> B;
    vector<ll> C(N);
    rep(i, N) cin >> C[i];
    vector<ll> S(N);
    rep(i, N) cin >> S[i];

    target = B;

    // segtree 二分探索
    ll L = 100001;
    segtree<ll, op, e> seg1(L);
    segtree<ll, op, e> seg2(L);
    for (ll i = 0; i < N; i++){
        seg1.set(C[i], seg1.get(C[i]) + S[i]);
        seg2.set(C[i], seg2.get(C[i]) + C[i] * S[i]);
    }
    ll ans = 0;
    // 市場操作をする→価格を 1 にかえるということ
    for (ll i = 0; i < N; i++){
        seg1.set(C[i], seg1.get(C[i]) - S[i]);
        seg1.set(1, seg1.get(1) + S[i]);
        seg2.set(C[i], seg2.get(C[i]) - C[i] * S[i]);
        seg2.set(1, seg2.get(1) + S[i]);

        ll id = seg2.max_right<f>(0);
        // debug(id);
        if (id == L){
            ans = max(ans, seg1.prod(0, L));
        }
        else{
            ll rem = B - seg2.prod(0, id);
            ll anssub = seg1.prod(0, id) + min(seg1.get(id), rem / id);
            ans = max(ans, anssub);
        }

        seg1.set(1, seg1.get(1) - S[i]);
        seg1.set(C[i], seg1.get(C[i]) + S[i]);
        seg2.set(1, seg2.get(1) - S[i]);
        seg2.set(C[i], seg2.get(C[i]) + C[i] * S[i]);
    }
    cout << ans << endl;
}