#include <bits/stdc++.h>
using namespace std;
long long n, x;
vector<long long> v;
long long dp[100];
long long pw(long long x, long long y) {
  if (dp[y] != -1) {
    return dp[y];
  }
  if (y <= 1) {
    return dp[y] = x;
  }
  return dp[y] = x * pw(x, y - 1);
}
void add(long long z) {
  for (int i = 0; i < pw(2, z); i++) {
    v.push_back(i + pw(2, z));
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  memset(dp, -1, sizeof dp);
  int b = 0;
  cin >> n >> x;
  for (int i = 19; i >= 2; i--) {
    if (n > pw(2, i)) {
      n -= pw(2, i);
      b = 1;
      add(i);
    }
  }
  v.push_back(pw(2, 19) + x);
  n--;
  if (n == 3) {
    v.push_back(pw(2, 19) + pw(2, 18));
    v.push_back(pw(2, 17) + 0);
    v.push_back(pw(2, 17) + pw(2, 18));
  } else if (n == 2) {
    v.push_back(pw(2, 19) + pw(2, 18));
    v.push_back(pw(2, 18) + 0);
  } else if (n == 1) {
    if (x == 0) {
      if (b) {
        if (v[0] == x) {
          v[1] += pw(2, 19);
        } else {
          v[0] += pw(2, 19);
        }
        v.push_back(0);
      } else {
        cout << "NO" << endl;
        return 0;
      }
    } else {
      v.push_back(pw(2, 19) + 0);
    }
  } else {
    if (b == 1) {
      if (v[0] == x) {
        v[1] += pw(2, 19);
      } else {
        v[0] += pw(2, 19);
      }
    } else {
      v[0] -= pw(2, 19);
    }
  }
  sort(v.begin(), v.end());
  cout << "YES" << endl;
  for (int i = 0; i < v.size(); i++) {
    cout << v[i] << " ";
  }
  return 0;
}
