You are given a positive integer (n) and a non-negative integer (k). Construct a permutation (p) of length (n) such that the following condition is satisfied: Let (f(i)=\operatorname{mex}(p_0,p_1,\ldots,p_i))(^{\text{∗}}) for every (0 \le i \lt n). Then, (f(0) \oplus f(1) \oplus \ldots \oplus f(n-1)) should equal (k), where (\oplus) denotes the bitwise XOR operation . Note that a permutation of length (n) is an array consisting of (n) distinct integers from (0) to (n-1) in arbitrary order. For example, (1,2,0,4,3) is a permutation, but (0,1,1) is not a permutation ((1) appears twice in the array), and (0,2,3) is also not a permutation ((n=3) but there is (3) in the array). (^{\text{∗}})The minimum excluded (MEX) of a collection of integers (c_1, c_2, \ldots, c_k) is defined as the smallest non-negative integer (x) which does not occur in the collection (c). Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The only line of each test case contains two integers (n) and (k) ((1 \le n \le 2 \cdot 10^5), (0 \le k \le 10^9)). It is guaranteed that the sum of (n) over all test cases does not exceed (2 \cdot 10^5). For each test case, if no such permutation exists, output " NO ". Otherwise, first output " YES " on a single line. Then, output (n) distinct integers (p_0,p_1,\ldots,p_{n-1}) ((0 \le p_i \lt n)), representing the permutation (p) you constructed. If there are multiple permutations satisfying the requirement, you may output any of them. 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 and second test cases, the only permutation of length (1) is (0), with $$$f(0)=\op