import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.math;


void main() {
    int n, x;
    scan(n, x);

    if (x == 1 || x == 2*n - 1) {
        writeln("No");
        return;
    }

    writeln("Yes");

    auto ans = new int[](2*n - 1);
    ans[] = -1;

    if (n == 2) {
        ans = iota(1, 4).array;
    }
    else {
        auto used = new bool[](2*n - 1 + 1);

        if (x != 2*n - 2) {
            ans[n - 1] = x;
            ans[n - 2] = 1;
            ans[n - 3] = 2*n - 1;
            ans[n] = 2*n - 2;
            used[x] = used[1] = used[2*n - 1] = used[2*n - 2] = 1;
        }
        else {
            ans[n - 1] = x;
            ans[n - 2] = 2*n - 1;
            ans[n - 3] = 1;
            ans[n] = 2;
            used[x] = used[1] = used[2*n - 1] = used[2] = 1;
        }

        int num = 1;

        foreach (i ; 0 .. 2*n - 1) {
            if (ans[i] != -1) continue;
            while (used[num]) num++;
            ans[i] = num++;
        }
    }

    writefln("%(%s\n%)", ans);
}



void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
