#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  if (k >= (int)bit_ceil(0U + n)) {
    cout << "No\n";
    return 0;
  }
  VI p(n), q(n);
  rep(i, n) p[i] = q[i] = i;
  auto dfs = [&](auto&& self, span<int> p, span<int> q) -> void {
    int n = p.size();
    if (n <= 1) return;
    int b = bit_ceil(0U + n) / 2;
    if (~k & b) {
      for (int i = b; i < n; i++) swap(q[i], q[i-b]);
    }
    self(self, p.subspan(0, b), q.subspan(0, b));
    self(self, p.subspan(b), q.subspan(b));
  };
  dfs(dfs, p, q);
  int v = 0;
  rep(i, n) v |= p[i] & q[i];
  assert(v == k);
  cout << "Yes\n";
  rep(i, n) cout << p[i] << " \n"[i + 1 == n];
  rep(i, n) cout << q[i] << " \n"[i + 1 == n];
}