#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::io::{stderr, stdin, stdout, BufWriter, StdoutLock, Write};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[allow(unused_macros)]
macro_rules ! input { ( source = $ s : expr , $ ( $ r : tt ) * ) => { let mut iter = $ s . split_whitespace ( ) ; let mut next = || { iter . next ( ) . unwrap ( ) } ; input_inner ! { next , $ ( $ r ) * } } ; ( $ ( $ r : tt ) * ) => { let stdin = std :: io :: stdin ( ) ; let mut bytes = std :: io :: Read :: bytes ( std :: io :: BufReader :: new ( stdin . lock ( ) ) ) ; let mut next = move || -> String { bytes . by_ref ( ) . map ( | r | r . unwrap ( ) as char ) . skip_while ( | c | c . is_whitespace ( ) ) . take_while ( | c |! c . is_whitespace ( ) ) . collect ( ) } ; input_inner ! { next , $ ( $ r ) * } } ; }
#[allow(unused_macros)]
macro_rules ! input_inner { ( $ next : expr ) => { } ; ( $ next : expr , ) => { } ; ( $ next : expr , $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let $ var = read_value ! ( $ next , $ t ) ; input_inner ! { $ next $ ( $ r ) * } } ; ( $ next : expr , mut $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let mut $ var = read_value ! ( $ next , $ t ) ; input_inner ! { $ next $ ( $ r ) * } } ; }
#[allow(unused_macros)]
macro_rules ! read_value { ( $ next : expr , ( $ ( $ t : tt ) ,* ) ) => { ( $ ( read_value ! ( $ next , $ t ) ) ,* ) } ; ( $ next : expr , [ $ t : tt ; $ len : expr ] ) => { ( 0 ..$ len ) . map ( | _ | read_value ! ( $ next , $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ next : expr , [ $ t : tt ] ) => { { let len = read_value ! ( $ next , usize ) ; ( 0 .. len ) . map ( | _ | read_value ! ( $ next , $ t ) ) . collect ::< Vec < _ >> ( ) } } ; ( $ next : expr , chars ) => { read_value ! ( $ next , String ) . chars ( ) . collect ::< Vec < char >> ( ) } ; ( $ next : expr , bytes ) => { read_value ! ( $ next , String ) . into_bytes ( ) } ; ( $ next : expr , usize1 ) => { read_value ! ( $ next , usize ) - 1 } ; ( $ next : expr , $ t : ty ) => { $ next ( ) . parse ::<$ t > ( ) . expect ( "Parse error" ) } ; }
#[allow(dead_code)]
struct Writer {
    s: String,
}
#[allow(unused_imports)]
use std::fmt::Display;
#[allow(dead_code)]
#[doc = " let mut writer = Writer::new();"]
#[doc = " writer.writeln(hoge);"]
#[doc = " writer.flush()"]
impl Writer {
    #[allow(dead_code)]
    pub fn new() -> Writer {
        Writer { s: String::new() }
    }
    #[allow(dead_code)]
    pub fn flush(&mut self) {
        print!("{}", self.s);
        self.s.clear();
    }
    pub fn write<T: Display>(&mut self, x: T) {
        self.s.push_str(&format!("{}", x));
    }
    pub fn writeln<T: Display>(&mut self, x: T) {
        self.s.push_str(&format!("{}", x));
        self.s.push('\n');
    }
    #[allow(dead_code)]
    pub fn write_vec<T: Display>(&mut self, xs: &Vec<T>) {
        if xs.len() == 0 {
            self.writeln("");
            return;
        }
        self.write(&format!("{}", xs[0]));
        for i in 1..xs.len() {
            self.write(&format!(" {}", xs[i]));
        }
        self.writeln("");
    }
}
#[allow(unused_macros)]
macro_rules ! dbg { ( $ ( $ a : expr ) ,* ) => { writeln ! ( & mut stderr ( ) , concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) . unwrap ( ) ; } }


#[allow(dead_code)]
fn main() {
    input! {
        n: usize,
        x: usize
    }
    let mut w = Writer::new();
    if n <= 2 {
        if x == 2 {
            println!("Yes");
            println!("{}", 1);
            println!("{}", 2);
            println!("{}", 3);
        } else {
            println!("No");
        }
        return;
    }

    if x == 1 || x == 2*n - 1 {
        println!("No");
    } else {
        let mut v: VecDeque<usize> = VecDeque::new();
        match x.cmp(&n) {
            Ordering::Equal => {
                v = (1..2*n).collect();
            },
            Ordering::Less => {
                v.push_back(x+1);
                v.push_back(x);
                v.push_back(x-1);
                v.push_back(x+2);
                let mut cnt = (2*n-1-4)/2;
                let mut add = 0;
                while cnt > 0 {
                    add += 1;
                    if x-1 <= add && add <= x+2 {
                        continue;
                    }
                    v.push_front(add);
                    cnt -= 1;
                }
                cnt = (2*n-1-4) / 2 + 1;
                while cnt > 0 {
                    add += 1;
                    if x-1 <= add && add <= x+2 {
                        continue;
                    }
                    v.push_back(add);
                    cnt -= 1;
                }
            },
            Ordering::Greater => {
                v.push_back(x-1);
                v.push_back(x);
                v.push_back(x+1);
                v.push_back(x-2);
                let mut cnt = (2*n-1-4)/2;
                let mut add = 0;
                while cnt > 0 {
                    add += 1;
                    if x-1 <= add && add <= x+2 {
                        continue;
                    }
                    v.push_front(add);
                    cnt -= 1;
                }
                cnt = (2*n-1-4) / 2 + 1;
                while cnt > 0 {
                    add += 1;
                    if x-2 <= add && add <= x+1 {
                        continue;
                    }
                    v.push_back(add);
                    cnt -= 1;
                }
            }
        }
        w.writeln("Yes");
        for vv in v {
            w.writeln(vv);
        }
    }
    w.flush();
}

Measured memory_bytes: 8444