#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define LL long long

using namespace std;

int main(){

    int N;cin>>N;
    int x;cin>>x;

    int ans[2*N-1];
    if(x==1||x==2*N-1)cout<<"No"<<endl;
    else{
        ans[N-1]=x;
        ans[N-2]=x-1;
        ans[N]  =x+1;

        int cnt =2*N-1;
        REP(i,2*N-1){
            if(i>=N-2&&i<=N)continue;

            while(cnt>=x-1&&cnt<=x+1)cnt--;
            ans[i]=cnt--;
        }
        cout<<"Yes"<<endl;
        REP(i,2*N-1)cout<<ans[i]<<endl;

    }


    return 0;
}