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.*;

public class Main {

	BufferedReader br;
	PrintWriter out;
	StringTokenizer st;
	boolean eof;

	static boolean nextPermutation(int[] a) {
		int n = a.length;
		int ptr = n - 2;
		while (ptr >= 0 && a[ptr] > a[ptr + 1]) {
			ptr--;
		}
		if (ptr < 0) {
			return false;
		}

		for (int i = ptr + 1, j = n - 1; i < j; i++, j--) {
			int tmp = a[i];
			a[i] = a[j];
			a[j] = tmp;
		}

		for (int i = ptr + 1;; i++) {
			if (a[ptr] < a[i]) {
				int tmp = a[ptr];
				a[ptr] = a[i];
				a[i] = tmp;
				return true;
			}
		}
	}

	int[] solve(int n, int x) {

		if (x == 1 || x == 2 * n - 1) {
			return null;
		}

		if (n == 2) {
			return new int[] { 1, 2, 3 };
		}

		int[] a = new int[2 * n - 1];
		int mid = n - 1;
		
		int delta = x == 2 * n - 2 ? -1 : 1;

		boolean[] used = new boolean[2 * n + 2];

		a[mid] = x;
		a[mid - 1] = x + delta;
		a[mid + 1] = x - delta;
		a[mid + 2] = x + 2 * delta;

		used[x] = used[x + delta] = used[x - delta] = used[x + 2 * delta] = true;

		int ptr = 1;
		for (int i = 0; i < mid - 1; i++) {
			while (used[ptr]) {
				ptr++;
			}
			a[i] = ptr;
			used[ptr] = true;
		}

		for (int i = mid + 3; i < 2 * n - 1; i++) {
			while (used[ptr]) {
				ptr++;
			}
			a[i] = ptr;
			used[ptr] = true;
		}

		return a;
	}

	int median(int a, int b, int c) {
		int[] tmp = { a, b, c };
		Arrays.sort(tmp);
		return tmp[1];
	}

	int go(int[] a) {
		while (a.length > 1) {
			int[] b = new int[a.length - 2];
			for (int i = 0; i < b.length; i++) {
				b[i] = median(a[i], a[i + 1], a[i + 2]);
			}
			a = b;
		}
		return a[0];
	}

	Main() throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);

//		for (int n = 2; n <= 10; n++) {
//			for (int x = 2; x < 2 * n - 1; x++) {
//				int[] a = solve(n, x);
//				if (go(a) != x) {
//					throw new AssertionError(n + " " + x);
//				}
//			}
//		}
		
		int n = nextInt();
		int x = nextInt();

		int[] a = solve(n, x);
		if (a == null) {
			out.println("No");
		} else {
			out.println("Yes");
			for (int y : a) {
				out.println(y);
			}
		}
		out.close();
	}

	public static void main(String[] args) throws IOException {
		new Main();
	}

	String nextToken() {
		while (st == null || !st.hasMoreTokens()) {
			try {
				st = new StringTokenizer(br.readLine());
			} catch (Exception e) {
				eof = true;
				return null;
			}
		}
		return st.nextToken();
	}

	String nextString() {
		try {
			return br.readLine();
		} catch (IOException e) {
			eof = true;
			return null;
		}
	}

	int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}
}