#nullable enable

#region
var (_input, _iter) = (Array.Empty<string>(), 0);
T I<T>() where T : IParsable<T>
{
    while (_iter >= _input.Length) (_input, _iter) = (Console.ReadLine()!.Trim().Split(' '), 0);
    return T.Parse(_input[_iter++], null);
}
#endregion

static T[] Range<T>(int n, Func<T> F) => Enumerable.Range(0, n).Select(_ => F()).ToArray();

var n = I<int>();
var b = I<int>();
var cz = Range(n, I<int>);
var sz = Range(n, I<int>);
var iz = Enumerable.Range(0, n).ToArray();
iz.AsSpan().Sort((x, y) => {
    var cx = cz[x];
    var cy = cz[y];
    var cc = cx.CompareTo(cy);
    if (cc != 0) return cc;
    var sx = sz[x];
    var sy = sz[y];
    return sy.CompareTo(sx);
});

long Solve(int x)
{
    var cards = new List<(int, int)>();
    for (var i = 0; i < n; i++)
    {
        var c = cz[i];
        var s = sz[i];
        if (i == x) cards.Add((1, s));
        else cards.Add((c, s));
    }
    cards.Sort();
    var res = 0L;
    long b0 = b;
    foreach (var (c, s) in cards)
    {
        var u = Math.Min(s, b0 / c);
        res += u;
        b0 -= u * c;
    }
    return res;
}

var j = 0;
{
    long b0 = b;
    while (j < n && b0 > 0)
    {
        var c = cz[iz[j]];
        if (b0 < c) break;
        var s = sz[iz[j]];
        b0 -= (long)c * s;
        if (b0 <= 0) break;
        j++;
    }
}
if (j == n)
{
    Console.WriteLine(Solve(0));
    return;
}
var (li, ri) = (-1, -1);
var (lv, rv) = (-1L, -1L);
for (var i = 0; i < j; i++)
{
    var c = cz[iz[i]];
    var s = sz[iz[i]];
    var p = (long)(c - 1) * s;
    if (p > lv) (li, lv) = (iz[i], p);
}
for (var i = j + 1; i < n; i++)
{
    var s = sz[iz[i]];
    if (s > rv) (ri, rv) = (iz[i], s);
}
var ans = Math.Max(Solve(iz[j]), Math.Max(Solve(li), Solve(ri)));
Console.WriteLine(ans);