We have a pyramid with N steps, built with blocks. The steps are numbered 1 through N from top to bottom. For each 1≤i≤N, step i consists of 2i-1 blocks aligned horizontally. The pyramid is built so that the blocks at the centers of the steps are aligned vertically.

<image>

A pyramid with N=4 steps

Snuke wrote a permutation of (1, 2, ..., 2N-1) into the blocks of step N. Then, he wrote integers into all remaining blocks, under the following rule:

* The integer written into a block b must be equal to the median of the three integers written into the three blocks directly under b, or to the lower left or lower right of b.



<image>

Writing integers into the blocks

Afterwards, he erased all integers written into the blocks. Now, he only remembers that the integer written into the block of step 1 was x.

Construct a permutation of (1, 2, ..., 2N-1) that could have been written into the blocks of step N, or declare that Snuke's memory is incorrect and such a permutation does not exist.

Constraints

* 2≤N≤10^5
* 1≤x≤2N-1

Input

The input is given from Standard Input in the following format:


N x


Output

If no permutation of (1, 2, ..., 2N-1) could have been written into the blocks of step N, print `No`.

Otherwise, print `Yes` in the first line, then print 2N-1 lines in addition.

The i-th of these 2N-1 lines should contain the i-th element of a possible permutation.

Examples

Input

4 4


Output

Yes
1
6
3
7
4
5
2


Input

2 1


Output

No
N, X = [int(_) for _ in input().split()]

from itertools import permutations

def calc(x):
    # print("*", x)
    def sub(y, debug=0):
        if debug:
            print("D", y)
        while len(y) > 1:
            y = [sorted(y[i:i+3])[1] for i in range(len(y) - 2)]
            if debug:
                print("D", y)
        return y
    y = sub(x)
    if y[0] == 2:
        pass
        sub(x, 1)
        print("=", x)
    return y[0]

#r = set([])
#for x in permutations(range(1, N+ 1)):
#    r.add(calc(x))

if X == 1 or X == N * 2 - 1:
    print("No")
else:
    print("Yes")
    if X == N * 2 - 2:
        xs = list(range(N - 1, X + 2)) + list(range(1, N - 1))
    else:
        ys = list(range(1, X - 1)) + list(range(X + 3, N * 2))
        xs = ys[:N-3] + [X + 2, X - 1, X, X + 1] + ys[N-3:]
    for x in xs:
        print(x)

"""
3 4
1 2 3 4 5
2 3 4 5 1
4 4

"""
