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
import java.io.*;
import java.util.*;

/**
 * Created by fcdkbear on 15.10.16.
 */
public class Main {

    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        new Task().solve(in, out);
        out.close();
    }


    static class Task {

        public void solve(InputReader in, PrintWriter out) {

            int n = in.nextInt();
            int x = in.nextInt();
            n = n + n - 1;
            if ((x == 1) || (x == n)) {
                out.println("No");
                return;
            }
            int mid = (n + 1) / 2;
            int[] res = new int[n];
            if (x == mid) {
                for (int i = 0; i < res.length; ++i) {
                    res[i] = i + 1;
                }
            } else if (x < mid) {
                int midIndex = n / 2;
                for (int i = n - 1; i > midIndex; --i) {
                    res[i] = i + 1;
                }
                res[midIndex] = x;
                res[midIndex - 1] = 1;
                int index = midIndex - 2;
                for (int i = mid; i > 1; --i) {
                    if (i != x) {
                        res[index] = i;
                        index--;
                    }
                }
            } else {
                int midIndex = n / 2;
                for (int i = 0; i < midIndex; ++i) {
                    res[i] = i + 1;
                }
                res[midIndex] = x;
                res[midIndex + 1] = n;
                int index = midIndex + 2;
                for (int i = mid; i < n; ++i) {
                    if (i != x) {
                        res[index] = i;
                        index++;
                    }
                }
            }
            out.println("Yes");
            for (int i = 0; i < res.length; ++i) {
                out.println(res[i]);
            }

        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

    }

}
