def op(x, y):
    return x+y
class SegTree:
    def __init__(self, init_val, op, ide_ele):
        n = len(init_val)
        self.n = n
        self.op = op
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = self.op(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        k += self.num
        self.tree[k] = x
        while k > 1:
            l, r = k, k^1
            if l > r:
                l, r = r, l
            self.tree[k >> 1] = self.op(self.tree[l], self.tree[r])
            k >>= 1

    def query(self, l, r):
        res_l = self.ide_ele
        res_r = self.ide_ele

        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res_l = self.op(res_l, self.tree[l])
                l += 1
            if r & 1:
                res_r = self.op(self.tree[r - 1], res_r)
            l >>= 1
            r >>= 1
        return self.op(res_l, res_r)

    def __getitem__(self, n):
        return self.tree[self.num+n]
    
    def List(self):
        return self.tree[self.num:self.num+self.n]
    
    def max_right(self, l, f, limit):
        if l == self.n:
            return self.n
        l += self.num
        sm = self.ide_ele
        while True:
            while l%2 == 0:
                l >>= 1
            if not f(self.op(sm, self.tree[l]), limit):
                while l < self.num:
                    l <<= 1
                    if f(self.op(sm, self.tree[l]), limit):
                        sm = self.op(sm, self.tree[l])
                        l += 1
                return l-self.num
            sm = self.op(sm, self.tree[l])
            l += 1
            if l & -l == l:
                break
        return self.n
    
    def min_left(self, r, f, limit):
        if r == 0:
            return 0
        r += self.num
        sm = self.ide_ele
        while True:
            r -= 1
            while r > 1 and r%2 == 1:
                r >>= 1
            if not f(self.op(self.tree[r], sm), limit):
                while r < self.num:
                    r = 2*r+1
                    if f(self.op(self.tree[r], sm), limit):
                        sm = self.op(self.tree[r], sm)
                        r -= 1
                return r+1-self.num
            sm = self.op(self.tree[r], sm)
            if r & -r == r:
                break
        return 0

def bisect_R(n, limit):
    return n <= limit

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

seg = SegTree([0]*(10**5+1), op, 0)
segC = SegTree([0]*(10**5+1), op, 0)
for i in range(N):
    seg.update(C[i], seg[C[i]]+C[i]*S[i])
    segC.update(C[i], segC[C[i]]+S[i])

ans = 0
for i in range(N):
    seg.update(C[i], seg[C[i]]-C[i]*S[i])
    segC.update(C[i], segC[C[i]]-S[i])
    seg.update(1, seg[1]+S[i])
    segC.update(1, segC[1]+S[i])
    b = seg.max_right(0, bisect_R, B)
    SUM = segC.query(0, b)
    rem = B-seg.query(0, b)
    SUM += rem//b
    ans = max(ans, SUM)
    seg.update(1, seg[1]-S[i])
    segC.update(1, segC[1]-S[i])
    seg.update(C[i], seg[C[i]]+C[i]*S[i])
    segC.update(C[i], segC[C[i]]+S[i])

print(ans)