#include <bits/stdc++.h>
using namespace std;
int main(void){
    int n;
    long long b;
    cin>>n>>b;
    vector<pair<long long,long long>>v(n,{0,0});
    for(int i=0;i<n;i++)cin>>v[i].first;
    for(int i=0;i<n;i++)cin>>v[i].second;
    sort(v.begin(),v.end());
    vector<long long>rc(n+1,0);
    vector<long long>rs(n+1,0);
    for(int i=0;i<n;i++){
        rc[i+1]=rc[i]+v[i].first*v[i].second;
        rs[i+1]=rs[i]+v[i].second;
        //cout<<v[i].first<<" "<<v[i].second<<" "<<rc[i+1]<<" "<<rs[i+1]<<endl; 
    }
    //cout<<endl;
    long long ans=0;
    for(int i=0;i<n;i++){
        long long tmp=0,sum=b;
        tmp=min(b,v[i].second);
        sum-=tmp;
        auto iter=upper_bound(rc.begin(), rc.end(),sum);
        int pos = iter-rc.begin()-1;
        if(pos>=i){
            sum+=v[i].first*v[i].second;
            iter=upper_bound(rc.begin(), rc.end(),sum);
            pos = iter-rc.begin()-1;
            tmp+=rs[pos]-v[i].second;
            sum-=rc[pos];
            // cout<<tmp<<"-";
            if(pos!=n)tmp+=sum/v[pos].first;
        }else{
            tmp+=rs[pos];
            sum-=rc[pos];
            if(pos!=n)tmp+=sum/v[pos].first;
            //cout<<"!";
        }
        ans=max(ans,tmp);
        //cout<<i<<" "<<pos<<" "<<tmp<<endl;
    }
    cout<<ans<<endl;
    return 0;
}