You are given arrays (a) and (b) of length (n) and an integer (m). The arrays only contain integers from (1) to (m), and both arrays contain all integers from (1) to (m). You may repeatedly perform either of the following operations on (a): cyclic shift(^{\text{∗}}) the array to the left swap two neighboring elements if their difference is at least (2). Is it possible to transform the first array into the second? (^{\text{∗}})A left cyclic shift of a zero-indexed array (p) of length (n) is an array (q) such that (q_i = p_{(i + 1) \bmod n}) for all (0 \le i < n). Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^5)). The description of the test cases follows. The first line of each test case contains two integers (n) and (m) ((2 \le m \le n \le 5\cdot10^5)) — the length of the arrays and the number of distinct elements in (a). The second line contains (n) integers (a_1, a_2, \ldots, a_n) ((1 \le a_i \le m)) — denoting the array (a). The third line contains (n) integers (b_1, b_2, \ldots, b_n) ((1 \le b_i \le m)) — denoting the array (b). It is guaranteed that both arrays contain all integers from (1) to (m). It is guaranteed that the sum of (n) over all test cases does not exceed (5\cdot10^5). For each test case, output " YES " if it is possible to transform the first array into the second and " NO " otherwise. You can output the answer in any case (upper or lower). For example, the strings " yEs ", " yes ", " Yes ", and " YES " will be recognized as positive responses. In the first test case, you can transform array (a) into array (b) with the following steps: (1), (2), (3) — shift to the left (2), (3), (1) — swap indices (2) and (3) (2), (1), (3) — shift to the left (1), (3), (2) — shift