#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
const long long mod=998244353;
const long long mod2=469762049;
int main(){
    cout.tie()->sync_with_stdio(0);
    cin.tie(0);
    int N;cin>>N;
    ll B;cin>>B;
    pair<ll,ll>C[N+1];
    for(int i=1;i<=N;i++) cin>>C[i].first;
    for(int i=1;i<=N;i++) cin>>C[i].second;
    sort(C+1,C+N+1);
    /*for(int i=1;i<=N;i++) cout<<C[i].first<<" ";
    cout<<endl;
    for(int i=1;i<=N;i++) cout<<C[i].second<<" ";
    cout<<endl;*/
    ll ruiseki[N+1],cnt[N+1];
    ruiseki[0]=0;
    cnt[0]=0;
    for(int i=1;i<=N;i++){
        ruiseki[i]=C[i].first*C[i].second;
        ruiseki[i]+=ruiseki[i-1];
        cnt[i]=C[i].second;
        cnt[i]+=cnt[i-1];
    }
    ll ans=0;
    for(int i=1;i<=N;i++){
        ll now=0;
        ll now_B=B-C[i].second;
        if(now_B<0){
            ans=B;
            break;
        }
        now+=C[i].second;
        if(ruiseki[i-1]<=now_B){
            now+=cnt[i-1];
            now_B-=ruiseki[i-1];
            auto iter=upper_bound(ruiseki+i+1,ruiseki+N+1,now_B+ruiseki[i]);
            int idx=distance(ruiseki,iter);
            idx--;
            assert(idx>=0);
            now_B-=(ruiseki[idx]-ruiseki[i]);
            now+=cnt[idx]-cnt[i];
            idx++;
            if(idx<=N){
                now+=now_B/C[idx].first;
            }
            chmax(ans,now);
            //cout<<i<<" "<<idx<<" "<<now<<endl;
        }
        else{
            auto iter=upper_bound(ruiseki,ruiseki+N+1,now_B);
            int idx=distance(ruiseki,iter);
            idx--;
            assert(idx>=0);
            now_B-=ruiseki[idx];
            now+=cnt[idx];
            idx++;
            if(idx<=N){
                now+=now_B/C[idx].first;
            }
            chmax(ans,now);
            //cout<<now<<endl;
        }
    }
    cout<<ans<<endl;
}