Задача "Торговля акциями"

n, x = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
minimum, i_minimum = a[0], 0
a0, b0 = -2, -2
ans = x
for i in range(1, n):
   if x // minimum * b[i] > ans:
      ans = x // minimum * b[i]
      a0 = i_minimum
      b0 = i
   if a[i] < minimum:
      minimum = a[i]
      i_minimum = i
print(ans)
print(a0 + 1, b0 + 1)

n, x = map(int, input().split())
 
a = list(map(int, input().split()))
b = list(map(int, input().split()))
 
top = x
top_buy = -1
top_sell = -1
min_a = 0
max_b = 0
max_diff = 0
 
for i in range(n):
    if a[i] <= x:
        if top_sell < i + 1:
            c = b[i:]
            max_b = max(c)
            top_sell_new = c.index(max_b) + i + 1
        if max_b - a[i] > max_diff:
            max_diff = max_b - a[i]
            min_a = a[i]
            top_buy = i + 1
            top_sell = top_sell_new
if min_a != 0:
    top = max_b * (x // min_a) + x % min_a
print(top)
print(top_buy, top_sell)

n, x = map(int, input().split())
 
a = list(map(int, input().split()))
b = list(map(int, input().split()))
 
top = x
top_buy = -1
top_sell = -1
m = 0
 
for i in range(n):
    h = x // a[i]
    o = x % a[i]
    if top_sell < i + 1:
        c = b[i:]
        m = max(c)
        top_sell_new = c.index(m) + i + 1
    if m * h + o > top:
        top = m * h + o
        top_buy = i + 1
        top_sell = top_sell_new
print(top)
print(top_buy, top_sell)

n, x = map(int, input().split())
 
a = list(map(int, input().split()))
b = list(map(int, input().split()))
 
d = [(n-1, b[n-1])]*n
mxi = n-1  # индекс макс c i
mx = b[n-1]  # макс c i
for i in range(n-2, -1, -1):
    if b[i] > mx:
        mxi = i
        mx = b[i]
    d[i] = (mxi, mx)
 
top = x
top_buy = -1
top_sell = -1
m = 0
 
for i in range(n):
    h = x // a[i]
    o = x % a[i]
    if top_sell < i + 1:
        top_sell_new = d[i][0] + 1
 
    m = d[i][1]
    if m * h + o > top:
        top = m * h + o
        top_buy = i + 1
        top_sell = top_sell_new
print(top)
print(top_buy, top_sell)

n, x = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
abest = 0
bbest = 1
amin = 0
if n != 1:
    for bj in range(2, n):
        if x // a[bj - 1] > x // a[amin]:
            amin = bj - 1
    
        if x // a[amin] * b[bj] + x % a[amin] > x // a[abest] * b[bbest] + x % a[
                abest]:
            abest = amin
            bbest = bj
 
if n != 1 and x // a[abest] * b[bbest] + x % a[abest] > x:
    print(x // a[abest] * b[bbest] + x % a[abest])
    print(abest + 1, bbest + 1)
else:
    print(x)
    print(-1, -1)