Problem: 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

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {

    static int N;
    static int X;
    static int LEN;

    public static void main(String[] args) {
        FastScanner sc = new FastScanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        N = sc.nextInt();
        X = sc.nextInt();
        LEN = 2*N-1;

        int[] ans = solve();
        if( ans != null ) {
            pw.println("Yes");
            for (int each : ans) {
                pw.println( each );
            }
        } else {
            pw.println("No");
        }
        pw.flush();
    }

    private static int[] solve() {
        if( N == 2 ) {
            return case_2();
        }

        if( X <= 2*N-2 &&  X >= 2 ) {
            int[] ans = new int[LEN];

            if( X == 2 ) {
                //   2 2
                // 3 2 1 4
                ans[N-2] = 3;
                ans[N-1] = 2;
                ans[N] = 1;
                ans[N+1] = 4;

                int v = 5;
                for (int i = 0; i < LEN; i++) {
                    if( N-2 <= i && i <= N+1 ) continue;
                    
                    ans[i] = v;
                    v++;
                }

            } else {
                //     X  X
                // X-2 X X+1 X-1
                ans[N-2] = X-2;
                ans[N-1] = X;
                ans[N] = X+1;
                ans[N+1] = X-1;

                int v = 1;
                for (int i = 0; i < LEN; i++) {
                    if( N-2 <= i && i <= N+1 ) continue;

                    if( X-2 <= v && v <= X+1 ) v = X+2;
                    ans[i] = v;
                    v++;
                }
                
            }
            return ans;

        } else {
            return null;
        }
    }

    static int[] case_2() {
        if( X == 2 ) {
            return new int[]{1, 2, 3};
        } else {
            return null;
        }
    }

    static class FastScanner {

        private BufferedReader reader;
        private StringTokenizer tokenizer;

        FastScanner(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
            tokenizer = null;
        }

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

        String nextLine() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    return reader.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }

            return tokenizer.nextToken("\n");
        }

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

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

        double nextDouble() {
            return Double.parseDouble(next());
        }

        int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = nextInt();
            return a;
        }

        long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++)
                a[i] = nextLong();
            return a;
        }
    }
}