B'Tenzing received 3n books from his fans. The books are arranged in 3 stacks with n books in each stack. Each book has a non-negative integer difficulty rating. Tenzing wants to read some (possibly zero) books. At first, his knowledge is 0 . To read the books, Tenzing will choose a non-empty stack, read the book on the top of the stack, and then discard the book. If Tenzing 's knowledge is currently u , then his knowledge will become u|v after reading a book with difficulty rating v . Here | denotes the bitwise OR operation. Note that Tenzing can stop reading books whenever he wants. Tenzing 's favourite number is x . Can you help Tenzing check if it is possible for his knowledge to become x ? Each test contains multiple test cases. The first line of input contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The description of test cases follows. The first line of each test case contains two integers n and x ( 1 <= q n <= q 10^5 , 0 <= q x <= q 10^9 ) -- the number of books in each stack and Tenzing 's favourite number. The second line of each test case contains n integers a_1,a_2, ldots,a_n ( 0 <= q a_i <= q 10^9 ) -- the difficulty rating of the books in the first stack, from top to bottom. The third line of each test case contains n integers b_1,b_2, ldots,b_n ( 0 <= q b_i <= q 10^9 ) -- the difficulty rating of the books in the second stack, from top to bottom. The fourth line of each test case contains n integers c_1,c_2, ldots,c_n ( 0 <= q c_i <= q 10^9 ) -- the difficulty rating of the books in the third stack, from top to bottom. It is guaranteed that the sum of n does not exceed 10^5 . For each test case, output "Yes" (without quotes) if Tenzing can make his knowledge equal to x , and "No" (without quotes) otherwise. You can output the answer in any case (upper or lo'...