#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18 + 1e17;
const long long mod = 1e9 + 7;
long long modInverse(long long a, long long m) {
  long long m0 = m;
  long long y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long q = a / m;
    long long t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
long long powm(long long a, long long b) {
  a = a % mod;
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return (res % mod);
}
const long long N = 2e5 + 6;
void solve() {
  int n, x;
  cin >> n >> x;
  if (n == 1) {
    cout << "YES\n";
    cout << x << '\n';
    return;
  } else if (n == 2 && x == 0) {
    cout << "NO\n";
    return;
  }
  if (n == 2) {
    cout << "YES\n";
    cout << 0 << ' ' << x << '\n';
    ;
    return;
  }
  int val1;
  int val2;
  long long val4 = 0;
  for (int i = 1; i <= n; i++) val4 = val4 ^ i;
  for (int i = 1; i <= n; i++) {
    bool bo = false;
    for (int j = i + 1; j <= n; j++)
      if ((i ^ j ^ val4) != x) {
        val1 = i;
        val2 = j;
        bo = true;
        break;
      }
    if (bo) break;
  }
  cout << "YES\n";
  long long val3 = 0;
  for (int i = 1; i <= n; i++)
    if (i != val1 && i != val2) {
      cout << i << ' ';
      val3 = val3 ^ i;
    }
  long long val = 1 << 18;
  cout << (val ^ val3) << ' ';
  cout << (val ^ x) << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  for (long long i = 1; i <= t; i++) {
    solve();
  }
}
