#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
ll B;
vector<pair<ll,ll>> V;
int C[101010],S[101010];

ll hoge(vector<pair<ll,ll>> V,int id) {
	if(id<N) V[id].first=1;
	sort(ALL(V));
	ll C=B;
	ll ret=0;
	FORR2(a,b,V) {
		ll add=min(b,C/a);
		C-=add*a;
		ret+=add;
	}
	return ret;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>B;
	FOR(i,N) cin>>C[i];
	FOR(i,N) {
		cin>>S[i];
		V.push_back({C[i],S[i]});
	}
	sort(ALL(V));
	ll sum=0;
	int maid=0;
	FOR(i,N) {
		if(sum+V[i].first*V[i].second>B) break;
		if((V[i].first-1)*V[i].second>(V[maid].first-1)*V[maid].second) maid=i;
	}
	int maid2=i+1;
	for(j=i+1;j<N;j++) if(V[j].second>V[maid2].second) maid2=j;
	ll ret=max({hoge(V,i),hoge(V,maid),hoge(V,maid2)});
	cout<<ret<<endl;
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}