import sys
input = sys.stdin.readline

from bisect import bisect

N=int(input())
B=int(input())
C=list(map(int,input().split()))
S=list(map(int,input().split()))

A=[]
for i in range(N):
    A.append((C[i],S[i]))

A.sort()

SUM=[0]
SUMko=[0]
for c,s in A:
    SUM.append(SUM[-1]+c*s)
    SUMko.append(SUMko[-1]+s)

ANS=0

for i in range(N):
    c,s=A[i]

    k=bisect(SUM,B-1*s)

    #print(B-1*s,k)

    if i<k-1:
        B2=B-s+c*s

        k=bisect(SUM,B2)
        score=SUMko[k-1]
        rest=B-s-SUM[k-1]
        if k-1<len(A):
            necc,necs=A[k-1]
            score+=min(necs,rest//necc)

        ANS=max(ANS,score)
        

    else:
        score=SUMko[k-1]+s
        rest=B-s-SUM[k-1]
        if k-1<len(A):
            necc,necs=A[k-1]
            score+=min(necs,rest//necc)

        ANS=max(ANS,score)

print(ANS)