#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pl = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
using mint=modint998244353;
// g++ a.cpp -std=c++23 -I.
// g++ -std=c++23 -I. a.cpp -o main
// g++ -std=c++23 -I. anaive.cpp -o naive
// g++ -std=c++23 -I. agene.cpp -o gene
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
namespace mp = boost::multiprecision;
using Bint = mp::cpp_int;
using Real = mp::number<mp::cpp_dec_float<1024>>;

vl solve(ll n,ll k){
    if(k!=0){
        ll a=-1;
        ll b=-1;
        rep(i,0,22){
            if((n-1)&(1<<i))a=i;
            if(k&(1<<i))b=i;
        }
        if(a==b){
            vl d=solve((1<<a),k-(1<<a));
            vl e=solve(n-(1<<a),0);
            vl ans;
            rep(i,0,d.size())ans.push_back(d[i]);
            rep(i,0,e.size())ans.push_back(e[i]+(1<<a));
            return ans;
        }
        else {
            vl r=solve(n,0);
            ll dd=(1<<a);
            if(dd*2==n)dd*=2;
            dd--;
            ll ac=0;
            rep(i,0,n){
                if(r[i]==dd)ac=i;
            }
            swap(r[ac],r[0]);
            swap(r[k],r[0]);            
            return r;
        }
    }
    else{
        
        ll a=-1;
        rep(i,0,22){
            if((n-1)&(1<<i))a=i;      
        }
        ll e=(1<<(a+1));
        vl r;
        if(e-n>0){
            r=solve(e-n,0);
        }
        rep(i,e-n,n){
            r.push_back(e-i-1);
        }
       
        return r;
    }
}

int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll n,k;
    cin>>n>>k;
    ll a=-1;
    ll b=-1;
    rep(i,0,22){
        if((n-1)&(1<<i))a=i;
        if(k&(1<<i))b=i;
    }
    if(a<b){
        cout<<"No"<<endl;
    }
    else{
        cout<<"Yes"<<endl;
        vl f=solve(n,k);
        rep(i,0,n){
            cout<<i<<" ";
        }
        cout<<endl;
        rep(i,0,n){
            cout<<f[i]<<" ";
        }
        cout<<endl;
    }
}