The first part is: [PART1].

Tl;DR; is we're trying to hack solutions which use double type to store integer values. In this part we will not hack the solution from the Part 1, but hopefully will get closer to it.

Instead hacking the initial solution to the original problem, let's try to formulate another, similar but simpler to hack problem.

Problem: "Very Annoying". Given two sorted arrays A, B of sizes $$$n_1, n_2$$$ where each element is integer and the following condition holds: $$$1 \leq \min(A), \min(B)$$$ and $$$\max(A), \max(B) \leq n_1 + n_2$$$.

The task: if $$$\prod_{a\in A} a \leq \prod_{b\in B} b$$$ print <=, otherwise print >.

Restriction: $$$n_1, n_2 \leq 10^6$$$.

Before going further, I invite you to try to solve this problem. If your solution is very short, please try this test (it actually contains many tests, so the first line contains the overall tests number). The correct answer is <= for all cases, so if you see >, your solution is WA.

If you used big integers in python, please use this generator to generate a test. If your solution hanged on this, you get TL.

# run: python3 gen.py > test2.in
from random import randint

UB = 1000000

def gen_test(n):
    return sorted([randint(1, UB) for _ in range(n)])

if __name__ == "__main__":
    print(1)
    print(UB, UB)
    print(*gen_test(UB))
    print(*gen_test(UB))