import sys
# input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################



# Binary Indexed Tree (Fenwick Tree)
# 0-indexed
class BIT:
    def __init__(self, n):
        self.n = n
        self.data = [0]*(n+1)
    def sum(self, i):
        s = 0
        while i > 0:
            s += self.data[i]
            i -= i & -i
        return s
    def add(self, i, x):
        assert 0 <= i < self.n
        i = i+1
        while i <= self.n:
            self.data[i] += x
            i += i & -i
    def set(self, i, x):
        assert 0 <= i <= self.n
        self.add(i,x-self.get(i))
    def get(self, i, j):
        return self.sum(j) - self.sum(i)
    def lower_bound(self, k):# a[0],…,a[i]>kなる最小のi
        n = self.n
        x = 0
        r = 1
        while r <= n:r <<= 1
        size = r
        while size:
            if x + size <= n and self.data[x+size] <= k:
                k-=self.data[x+size]
                x += size
            size >>= 1
        return x
    def debug(self):
        res = []
        n = self.n
        for i in range(n):
            res.append(self.get(i))
        print(*res)

n = ni()
b = ni()
c = na()
s = na()
idx = sorted(range(n), key = lambda i: c[i])
c = [c[i] for i in idx]
s = [s[i] for i in idx]

ruis = [0] * (n + 1)

bit = BIT(n)
for i in range(n):
    bit.add(i, s[i] * c[i])
    ruis[i+1] = ruis[i] + s[i]

ans = -10 ** 18
for i in range(n):
    bit.add(i, -s[i] * (c[i] - 1))
    z = c[i]
    c[i] = 1
    x = bit.lower_bound(b)
    y = bit.get(0, x)
    if x == n:
        ans = max(ans, ruis[-1])
    else:
        # print(x, y)
        ans = max(ans, ruis[x] + (b - y) // c[x])
        # print(ruis[x] + (b - y) // c[x])
    
    c[i] = z
    bit.add(i, s[i] * (c[i] - 1))

print(ans)