B"Bob has a grid with 3 rows and n columns, each of which contains either a_i or -a_i for some integer 1 <= q i <= q n . For example, one possible grid for n=4 is shown below: begin{bmatrix} a_1 & -a_2 & -a_3 & -a_2 -a_4 & a_4 & -a_1 & -a_3 a_1 & a_2 & -a_2 & a_4 end{bmatrix} Alice and Bob play a game as follows: For example, suppose Alice gives Bob the array [1, -1, -1, 1] for the grid above. Then the following will happen (colors are added for clarity): begin{bmatrix} color{red}{a_1} & color{green}{-a_2} & color{blue}{-a_3} & color{green}{-a_2} -a_4 & a_4 & color{red}{-a_1} & color{blue}{-a_3} color{red}{a_1} & color{green}{a_2} & color{green}{-a_2} & a_4 end{bmatrix} xrightarrow{[ color{red}{1}, color{green}{-1}, color{blue}{-1},1]} begin{bmatrix} color{red}{1} & color{green}{1} & color{blue}{1} & color{green}{1} -1 & 1 & color{red}{-1} & color{blue}{1} color{red}{1} & color{green}{-1} & color{green}{1} & 1 end{bmatrix} xrightarrow{ text{sort each column}} begin{bmatrix} -1 & -1 & -1 & 1 mathbf{1} & mathbf{1} & mathbf{1} & mathbf{1} 1 & 1 & 1 & 1 end{bmatrix} ,. Since the middle row is all 1 , Alice wins. Given Bob's grid, determine whether or not Alice can choose the array a to win the game. The first line contains a single integer t ( 1 <= q t <= q 1000 ) -- the number of test cases. The first line of each test case contains a single integer n ( 2 <= q n <= q 500 ) -- the number of columns of Bob's grid. The next three lines each contain n integers, the i -th of which contains g_{i,1}, g_{i,2}, ... , g_{i,n} ( -n <= q g_{i,j} <= q n , g_{i,j} neq 0 ), representing Bob's grid. If cell x > 0 is in the input, that cell in Bob's grid should contain a_x ; if x < 0 is in the input, that cell in Bob's grid should contain -a_{-x} . See the sample input "...