#include <iostream>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <string>
#include <stack>
#include <limits>
#include <climits>
#include <cassert>
#include <fstream>
#include <cstring>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdio>
#include <ciso646>
#include <set>
#include <array>

using namespace std;

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

#define inf 0x3f3f3f3f
#define PB push_back
#define MP make_pair
#define ALL(a) (a).begin(),(a).end()
#define SET(a,c) memset(a,c,sizeof a)
#define CLR(a) memset(a,0,sizeof a)
#define pii pair<int,int>
#define pcc pair<char,char>
#define pic pair<int,char>
#define pci pair<char,int>
#define VS vector<string>
#define VI vector<int>
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define MIN(a,b) (a>b?b:a)
#define MAX(a,b) (a>b?a:b)
#define pi 2*acos(0.0)
#define INFILE() freopen("in0.txt","r",stdin)
#define OUTFILE()freopen("out0.txt","w",stdout)
#define ll long long
#define ull unsigned long long
#define eps 1e-14
#define FST first
#define SEC second
#define SETUP cin.tie(0), ios::sync_with_stdio(false), cout << setprecision(15)

namespace {
	struct input_returnner {
		int N; input_returnner(int N_ = 0) :N(N_) {}
		template<typename T> operator vector<T>() const { vector<T> res(N); for (auto &a : res) cin >> a; return std::move(res); }
		template<typename T> operator T() const { T res; cin >> res; return res; }
		template<typename T> T operator - (T right) { return T(input_returnner()) - right; }
		template<typename T> T operator + (T right) { return T(input_returnner()) + right; }
		template<typename T> T operator * (T right) { return T(input_returnner()) * right; }
		template<typename T> T operator / (T right) { return T(input_returnner()) / right; }
		template<typename T> T operator << (T right) { return T(input_returnner()) << right; }
		template<typename T> T operator >> (T right) { return T(input_returnner()) >> right; }
	};
	template<typename T> input_returnner in() { return in<T>(); }
	input_returnner in() { return input_returnner(); }
	input_returnner in(int N) { return std::move(input_returnner(N)); }
}

void solve();
/// ---template---

signed main(void) {
	SETUP;
	solve();
	return 0;
}

void solve() {
	int N, x; cin >> N >> x;
	if (x == 1 or x == 2 * N - 1) {
		cout << "No" << endl;
		return;
	}
	int mid = (2 * N - 1) / 2 + 1;
	vector<int> res(2 * N, -1);
	vector<bool> used(2 * N, false);
	res[mid] = x;

	if (N == 2) {
		if (x == 2) {
			cout << "Yes" << endl;
			REP(i, 3) cout << i + 1 << endl;
		}
		else
			cout << "No" << endl;

		return;
	}

	cout << "Yes" << endl;
	if (x == 2 * N - 2) {
		res[mid - 1] = x + 1;
		res[mid + 1] = x - 2;
		res[mid - 2] = x - 1;
		used[x] = used[x + 1] = used[x - 2] = used[x - 1] = true;
	}
	else {
		res[mid - 1] = x - 1;
		res[mid + 1] = x + 2;
		res[mid - 2] = x + 1;
		used[x] = used[x - 1] = used[x + 2] = used[x + 1] = true;
	}

	int it = 1;
	REP(i, mid-3) {
		while (1) {
			if (not used[it]) {
				cout << it << endl;
				++it;
				break;
			}
			++it;
		}
	}
	FOR(i, mid-2, mid+2) {
		cout << res[i] << endl;
	}
	FOR(i, mid + 1, 2 * N - 1) {
		while (1) {
			if (not used[it]) {
				cout << it << endl;
				++it;
				break;
			}
			++it;
		}
	}
}

Measured memory_bytes: 2304