Codeforces Round #435 (Div. 2): C. Mahmoud and Ehab and the xor

C. Mahmoud and Ehab and the xor

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 106.

Input

The only line contains two integers n and x (1 ≤ n ≤ 105, 0 ≤ x ≤ 105) — 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

题意：

给你两个数n和x，问存不存在n个互不相同的非负整数满足异或和为x，如果存在输出任意一种

构造方法：

①如果n=1，直接输出x，如果n=2 && x==0输出NO（这是唯一一个无法构造的情况）

②这n个数分别是1, 2, 3, … ,n-1和x^1^2^3^…^(n-1)，令t=x^1^2^3^…^(n-1)

③如果t<1 || t>=n，构造成功

④如果t>=1 && t<n，说明有且只有两个数字重复，删掉这两个数字，输出一个0

⑤但这个时候还缺一个数字怎么办？把1拆成131072和131073或者把2拆成131072和131074即可

具体拆哪个看t取值

#include<stdio.h>
int flag[100005];
int main(void)
{
	int n, i, x, p;
	scanf("%d%d", &n, &x);
	if(n==1)
		printf("YES\n%d\n", x);
	else if(n==2 && x==0)
		printf("NO\n");
	else
	{
		printf("YES\n");
		p = -1;
		for(i=1;i<=n-1;i++)
			x ^= i;
		if(x>=1 && x<=n-1)
		{
			if(x==1)
				printf("131072 131074 0"), p = 2;
			else
				printf("131072 131073 0"), p = 1;
		}
		else
			printf("%d", x);
		for(i=1;i<=n-1;i++)
		{
			if(i!=x && i!=p)
				printf(" %d", i);
		}
		printf("\n");
	}
	return 0;
}