#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <ctime>
//#include <numeric>
//#include <list>
//#include <iomanip>

//#if __cplusplus >= 201103L
//#include <array>
//#include <tuple>
//#include <initializer_list>
//#include <forward_list>
//
//#define cauto const auto&
//#else

//#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)

void mainmain(){
	int n, x;
	cin>>n>>x;
	// int m = 9;
	// vint v(m);
	// srand(time(NULL));
	// rep(i,m) v[i]=i+1;
	// rep(i,10000000) swap(v[rand()%m],v[rand()%m]);
	// while(v.size()>1){
	// 	rep(i,(m-v.size())) cout<<" ";
	// 	rep(i,v.size()) cout<<v[i]<<" ";
	// 	cout<<endl;
	// 	vint next;
	// 	rep(i,v.size()-2){
	// 		int t = v[i]+v[i+1]+v[i+2];
	// 		next.PB(t-min({v[i],v[i+1],v[i+2]})-max({v[i],v[i+1],v[i+2]}));
	// 	}
	// 	v=next;
	// }
	// cout<<v[0]<<endl;
	if(x==1||x==2*n-1){
		cout<<"No"<<endl;
	}
	else{
		cout<<"Yes"<<endl;
		if(n==2){
			rep(i,3){
				cout<<i+1<<endl;
			}
			return;
		}
		vint v(2*n-1);
		if(x==2){
			v[v.size()/2]=x;
			v[v.size()/2+1]=x-1;
			v[v.size()/2+2]=x+1;
			v[v.size()/2-1]=x+2;
			int p = 1;
			rep(i,v.size()){
				if(v.size()/2-1<=i && i <= v.size()/2+2) continue;
				while(x-1 <= p && p <= x+2) p++;
				v[i] = p++;
			}
		}
		else{
			v[v.size()/2]=x;
			v[v.size()/2+1]=x+1;
			v[v.size()/2+2]=x-1;
			v[v.size()/2-1]=x-2;
			int p = 1;
			rep(i,v.size()){
				if(v.size()/2-1<=i && i <= v.size()/2+2) continue;
				while(x-2 <= p && p <= x+1) p++;
				v[i] = p++;
			}
		}
		rep(i,v.size()) cout<<v[i]<<endl;
	}
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(20);
    mainmain();
}

Measured memory_bytes: 2304