Codeforces - 862C Mahmoud and Ehab and the xor

C. Mahmoud and Ehab and the xor

Mahmoud and Ehab are on the third stage of their adventures now. As you know, Dr. Evil likes sets. This time he won't show them any set from his large collection, but will ask them to create a new set to replenish his beautiful collection of sets.

Dr. Evil has his favorite evil integer x. He asks Mahmoud and Ehab to find a set of n distinct non-negative integers such the bitwise-xor sum of the integers in it is exactly x. Dr. Evil doesn't like big numbers, so any number in the set shouldn't be greater than 10⁶.

Input

The only line contains two integers n and x (1 ≤ n ≤ 10⁵, 0 ≤ x ≤ 10⁵) — the number of elements in the set and the desired bitwise-xor, respectively.

Output

If there is no such set, print "NO" (without quotes).

Otherwise, on the first line print "YES" (without quotes) and on the second line print n distinct integers, denoting the elements in the set is any order. If there are multiple solutions you can print any of them.

Examples

Input

5 5

Output

YES
1 2 4 5 7

Input

3 6

Output

YES
1 2 5

Note

You can read more about the bitwise-xor operation here: https://en.wikipedia.org/wiki/Bitwise_operation#XOR

For the first sample .

For the second sample .

题意：给你一个数X问你能不能分解成N个数，使得这N个数的异或和为X

解题思路：重点就是抓住异或的性质，两个相同的数异或等于0，任何数异或0结果都不变。意思就是例如  3^4^5^3^4^5^6=6  。然后这道题就很简单了。假设我们要使最后的结果为X，大小为4，那么我们可以   a^b^c^(a^b^c)^x=x，其中四个数分别为，a,b,c,(a^b^c)。但是a^b^c可能等于a,b,c中的一个数，所以我们要用一些足够特殊的数完成这个操作。题目告诉了每个数的最大值。具体看代码实现。

#include
#include
#include
#include
#include