B'Kristina has two arrays a and b , each containing n non-negative integers. She can perform the following operation on array a any number of times: Determine whether Kristina can get an array b from an array a in some number of operations (probably zero). In other words, can she make a_i = b_i after some number of operations for each 1 <= i <= n ? For example, let n = 4 , a = [3, 5, 4, 1] and b = [1, 3, 2, 0] . In this case, she can apply the operation twice: Thus, in two operations, she can get an array b from an array a . The first line of the input contains an integer t ( 1 <= t <= 10^4 ) --the number of test cases in the test. The descriptions of the test cases follow. The first line of each test case contains a single integer n ( 1 <= n <= 5 cdot 10^4 ). The second line of each test case contains exactly n non-negative integers a_1, a_2, ... , a_n ( 0 <= a_i <= 10^9 ). The third line of each test case contains exactly n non-negative integers b_1, b_2, ... , b_n ( 0 <= b_i <= 10^9 ). It is guaranteed that the sum of n values over all test cases in the test does not exceed 2 cdot 10^5 . For each test case, output on a separate line: You can output YES and NO in any case (for example, strings yEs, yes, Yes and YES will be recognized as a positive response). The first test case is analyzed in the statement. In the second test case, it is enough to apply the operation to array a once. In the third test case, it is impossible to get array b from array a . '...