import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int[] solve(in int N, in int X) {
  auto ans = new int[N];
  const head = 1 + (N - 1) % 4;
  ans[0] = X;
  foreach (j; 1 .. head) {
    ans[0] ^= j;
    ans[j] = j;
  }
  if (ans[0] < head) {
    if (ans[0] == 1) {
      ans[0] ^= 4;
      ans[2] ^= 4;
    } else {
      ans[0] ^= 4;
      ans[1] ^= 4;
    }
  }
  for (int i = head, x = 4; i < N; x += 4) {
    bool ok = true;
    foreach (j; 0 .. 4) {
      ok = ok && !(x <= ans[j] && ans[j] < x + 4);
    }
    if (ok) {
      foreach (j; 0 .. 4) {
        ans[i + j] = x + j;
      }
      i += 4;
    }
  }
  return ans;
}

unittest {
  foreach (N; 1 .. 10) foreach (X; 1 .. 10) {
    const res = solve(N, X);
    writeln(N, " ", X, ": ", res);
    assert(res.length == N);
    foreach (i; 0 .. N) foreach (j; i + 1 .. N) {
      assert(res[i] != res[j]);
    }
    assert(res.fold!"a ^ b" == X);
  }
}

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const X = readInt();
      
      const ans = solve(N, X);
      foreach (i; 0 .. N) {
        writeln(ans[i]);
      }
    }
  } catch (EOFException e) {
  }
}