#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long N = 1e2 + 10;
const long long MAX = 1e18;
template <typename T>
T gcd(T x, T y) {
  return y == 0 ? x : gcd(y, x % y);
}
template <typename T>
T lcm(const T &a, const T &b) {
  return (a * b) / gcd(a, b);
}
template <typename T>
void pfact(vector<pair<T, T> > &v, T k) {
  T i;
  for (i = 2; i <= sqrt(k); i++)
    if (k % i == 0) {
      T x = 0;
      while (k % i == 0) {
        k /= i;
        x++;
      }
      v.push_back(make_pair(i, x));
    }
  if (k != 1) {
    v.push_back(make_pair(k, 1));
  }
}
void sieve(int *spf) {
  spf[1] = 1;
  for (int i = 2; i < N; i++) spf[i] = i;
  for (int i = 4; i < N; i += 2) spf[i] = 2;
  for (int i = 3; i * i < N; i++) {
    if (spf[i] == i) {
      for (int j = i * i; j < N; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
vector<int> getFactorization(int x, int *spf) {
  vector<int> ret;
  while (x != 1) {
    ret.push_back(spf[x]);
    x = x / spf[x];
  }
  return ret;
}
int main() {
  long long i, j, n, x;
  cin >> n >> x;
  if (n == 1) {
    cout << "YES" << endl;
    cout << x << endl;
    return 0;
  }
  if (n == 2 && x != 0) {
    cout << "YES" << endl;
    cout << 0 << " " << x << endl;
    return 0;
  }
  if (n == 2 && x == 0) {
    cout << "NO" << endl;
    return 0;
  }
  if (n == 3 && x == 0) {
    cout << "YES" << endl;
    cout << 1 << " " << 2 << " " << 3 << endl;
    return 0;
  }
  if (n == 3 && x != 0) {
    cout << "YES" << endl;
    cout << 0 << " " << 262144 << " " << (262144 ^ x) << endl;
    return 0;
  }
  long long a[n];
  a[0] = 262144;
  j = 1;
  for (i = 1; i < n - 2; i++) {
    if (j == x) {
      j++;
    }
    a[i] = j;
    j++;
  }
  long long xo = 0;
  for (i = 1; i < n - 2; i++) {
    xo = xo ^ a[i];
  }
  if (xo == 0) {
    a[n - 3] += 1;
  }
  xo = 0;
  for (i = 1; i < n - 2; i++) {
    xo = xo ^ a[i];
  }
  xo = xo ^ a[0];
  a[n - 2] = xo;
  a[n - 1] = x;
  cout << "YES" << endl;
  for (i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << endl;
}
