#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const int dx[] = {0, 1, -1, 0};
const int dy[] = {1, 0, 0, -1};
long long gcd(long long a, long long b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
long long fast_power(long long base, long long power) {
  long long res = 1;
  while (power) {
    if (power & 1) res = (res * base) % mod;
    base = (base * base) % mod;
    power /= 2;
  }
  return (res % mod);
}
void ff() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
}
void in_out_txt() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
vector<string> vec;
string str;
int n, x, y, c;
int main() {
  ff();
  cin >> n >> x;
  if (n == 2 && x == 0)
    cout << "NO" << endl;
  else if (n == 1)
    cout << "YES\n" << x << endl;
  else if (n == 2)
    cout << "YES\n" << 0 << " " << x << endl;
  else {
    cout << "YES" << endl;
    int p = fast_power(2, 17);
    int p2 = 2 * p, y = 0;
    for (int i = 1; i <= n - 3; i++) {
      cout << i << " ";
      y = y ^ i;
    }
    if (y == x)
      cout << p << " " << p2 << " " << (p ^ p2) << endl;
    else
      cout << 0 << " " << p << " " << (p ^ x ^ y) << endl;
  }
  return 0;
}
