#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <set>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)

using namespace std;
typedef long long int lli;
const int MAX=1e5;

int main(){
	int N,x;
	cin>>N>>x;
	
	if(x==1||x==2*N-1)cout<<"No";
	else if(x<=N){
		cout<<"Yes"<<endl;
		for(int i=N+x;i<=2*N-1;i++)cout<<i<<endl;
		rep1(i,x+N-1)cout<<i<<endl;
	}
	else{
		cout<<"Yes"<<endl;
		for(int i=x-N;i>=1;i--)cout<<i<<endl;
		for(int i=2*N-1;i>=x-N+1;i--)cout<<i<<endl;
	}
}