B'There is an array a of length n . You may perform the following operation on it: You are also given another array b of length n which is a permutation of a . Find a sequence of at most n^2 operations that transforms array a into b , or report that no such sequence exists. Each test contains multiple test cases. The first line contains a single integer t ( 1 <= q t <= q 100 ) -- the number of test cases. The description of the test cases follows. The first line of each test case contains an integer n ( 1 <= n <= 500 ) -- the length of array a and b . The second line of each test case contains n integers a_1, a_2, ldots, a_n ( 1 <= a_i <= n ) -- elements of the array a . The third line of each test case contains n integers b_1, b_2, ldots, b_n ( 1 <= b_i <= n ) -- elements of the array b . It is guaranteed that b is a permutation of a . It is guaranteed that the sum of n over all test cases does not exceed 500 . For each test case, output "NO" (without quotes) if it is impossible to turn a into b using at most n^2 operations. Otherwise, output "YES" (without quotes). Then output an integer k ( 0 <= q k <= q n^2 ) denoting the number of operations you will perform. Note that you don 't have to minimize the number of operations. Afterwards, output k lines. The i -th line should contain two integers l_i and r_i ( 1 <= q l_i <= q r_i <= q n ) -- the left and right indices for the i -th operation. You can output "YES" and "NO" in any case (for example, strings "yEs", "yes" and "Yes" will be recognized as a positive response). If there are multiple possible sequences of operations, you may output any of them. In the first test case, we can perform the following operations: [1,2,4,3,1,2,1,1] xrightarrow[l=5, ,r=8]{} [1,2,4,3,1,1,2,1] xrightarro'...