Сортировка дробей

from fractions import Fraction
I = lambda: map(int, input().split())
n, q = I()
a = list(I())
b = list(I())
c = list(I())
f = sorted(Fraction(a[i], b[j]) for i in range(n) for j in range(n))
for i in c:
    print(*f[i - 1].as_integer_ratio())

a = [1, 2]
b = [3, 1]
f = []
acursor = 0
bcursors = [0] * len(a)
while len(f) < len(a) * len(b):
    if acursor == 0 or bcursors[acursor - 1] == len(b):
        bval = 1e-6
    else:
        bval = b[bcursors[acursor - 1]]
    while acursor > 0 and (bcursors[acursor] == len(b) or a[acursor - 1] / bval < a[acursor] / b[bcursors[acursor]]):
         acursor -= 1
         if acursor == 0 or bcursors[acursor - 1] == len(b):
            bval = 1e-6
         else:
            bval = b[bcursors[acursor - 1]]
    if acursor == len(a) - 1 or bcursors[acursor + 1] == len(b):
        bval = 1e-6
    else:
        bval = b[bcursors[acursor + 1]]
    while acursor < len(a) - 1 and (bcursors[acursor] == len(b) or a[acursor + 1] / bval < a[acursor] / b[bcursors[acursor]]):
         acursor += 1
         if acursor == len(a) - 1 or bcursors[acursor + 1] == len(b):
            bval = 1e-6
         else:
            bval = b[bcursors[acursor + 1]]
    f.append((a[acursor], b[bcursors[acursor]]))
    bcursors[acursor] += 1
print(f)