#include<iostream>
#include<vector>
#include<string>
#include<cstring>
#include<algorithm>
#include<map>
#include<set>

using namespace std;
typedef long long ll;

int main() {
	int N, x;
	cin >> N >> x;
	if (x == 1 || x == 2*N-1) {
		cout << "No" << endl;
	} else {
		cout << "Yes" << endl;
		vector<int> ans(2*N-1);
		for (int i = 0; i < N; i++) {
			ans[i+N] = (x+i)%(2*N-1) + 1;
			ans[N-i-1] = (x+2*N-2-i)%(2*N-1) + 1;
		}
		for (int el : ans)
			cout << el << endl;
	}
	return 0;
}
