#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>

using namespace std;
using ll = long long;
using ull = unsigned long long;

#ifndef __MACRO_H__
#define __MACRO_H__

#define all(collection)  (collection).begin(), (collection).end()		// begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++)					// repeat
#define repr(i, begin, end) for (ll i = begin - 1; end <= i; i--)		// repeat reverse

std::chrono::system_clock::time_point  start;

void TimeStart(void)
{
	start = std::chrono::system_clock::now();
}

void TimeEnd(void)
{
	auto time = std::chrono::system_clock::now() - start;
	auto msec = std::chrono::duration_cast<std::chrono::milliseconds>(time).count();
	cerr << endl << msec << " msec " << endl;
}

#endif


class AGC006B
{
public:
	AGC006B()
	{
		cin >> n;
		cin >> x;
	}
	void Run(void)
	{
		ll box_max = 2 * n - 1;
		vector<ll> ans(box_max);

		if (x == 1 || x == box_max)
		{
			cout << "No" << endl;
			return;
		}

		if (n == 2)
		{
			if (x == 2)
			{
				cout << "Yes" << endl;
				cout << "1" << endl;
				cout << "2" << endl;
				cout << "3" << endl;
			}
			else
			{
				cout << "No" << endl;
			}
			return;
		}

		if (x == 2)
		{
			ans[box_max / 2 - 1] = x + 1;
			ans[box_max / 2] = x;
			ans[box_max / 2 + 1] = x - 1;
			ans[box_max / 2 + 2] = x + 2;
		}
		else
		{
			ans[box_max / 2 - 1] = x - 2;
			ans[box_max / 2] = x;
			ans[box_max / 2 + 1] = x + 1;
			ans[box_max / 2 + 2] = x - 1;
		}

		cout << "Yes" << endl;
		ll n = 0;
		rep(i, 0, box_max)
		{
			if (i != box_max / 2 - 1)
			{
				UpdateNumber(n);
				ans[i] = n;
			}
			else
			{
				i = box_max / 2 + 2;
			}

		}

		for (const auto& e : ans)
			cout << e << endl;
	}
private:
	ll UpdateNumber(ll& n)
	{
		if (x == 2)
		{
			n = (n + 1 == x - 1) ? x + 3 : n + 1;
			return n;
		}

		n = (n + 1 == x - 2) ? x + 2 : n + 1;
		return n;
	}
	ll n;
	ll x;
};


int main(void)
{
	AGC006B agc006b;
	agc006b.Run();

	return 0;
}

Measured memory_bytes: 3200