You are given two integers n and d. You need to construct a rooted binary tree consisting of n vertices with a root at the vertex 1 and the sum of depths of all vertices equals to d.

A tree is a connected graph without cycles. A rooted tree has a special vertex called the root. A parent of a vertex v is the last different from v vertex on the path from the root to the vertex v. The depth of the vertex v is the length of the path from the root to the vertex v. Children of vertex v are all vertices for which v is the parent. The binary tree is such a tree that no vertex has more than 2 children.

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 1000) — the number of test cases.

The only line of each test case contains two integers n and d (2 ≤ n, d ≤ 5000) — the number of vertices in the tree and the required sum of depths of all vertices.

It is guaranteed that the sum of n and the sum of d both does not exceed 5000 (∑ n ≤ 5000, ∑ d ≤ 5000).

Output

For each test case, print the answer.

If it is impossible to construct such a tree, print "NO" (without quotes) in the first line. Otherwise, print "{YES}" in the first line. Then print n-1 integers p_2, p_3, ..., p_n in the second line, where p_i is the parent of the vertex i. Note that the sequence of parents you print should describe some binary tree.

Example

Input


3
5 7
10 19
10 18


Output


YES
1 2 1 3 
YES
1 2 3 3 9 9 2 1 6 
NO

Note

Pictures corresponding to the first and the second test cases of the example:

<image>

<image>
import java.util.*;

import java.io.*;

public class dsu {

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(System.out);
		int t = Integer.parseInt(br.readLine());
		TreeSet<Integer> div[] = new TreeSet[3 * 10000];
		for (int i = 0; i < div.length; i++) {
			div[i] = new TreeSet<>();
		}
		for (int i = 1; i < div.length; i++) {
			for (int j = 1; j <= Math.ceil(Math.sqrt(i)); j++) {
				if (i % j == 0) {
					div[i].add(j);
					div[i].add(i / j);
				}
			}
		}
		while (t-- > 0) {
			StringTokenizer st = new StringTokenizer(br.readLine());
			int n = Integer.parseInt(st.nextToken());
			int m = Integer.parseInt(st.nextToken());
			ArrayList<Integer> a = new ArrayList<>();
			int i = 1;
			int sum = 0;
			int idx = 0;
			int x = 1;
			int q = n - 1;
			while (n > 0) {
				a.add(Math.min(i, n));
				n -= Math.min(i, n);
				i *= 2;
			}
			for (int j = 0; j < a.size(); j++) {
				sum += a.get(j) * (j);

			}
			boolean f = true;
			long max = (q * 1l * (q + 1)) / 2;
			if (m < sum || m > max) {
				f = false;
			}
			m -= sum;
			// System.out.println(a+" "+sum);
			x = -1;
			if (f)
				while (m != 0 && sum != max && sum != x) {
					x = sum;
					for (int j = 0; j < a.size() - 1; j++) {
						if ((a.get(j) - 1) * 2 >= (a.get(j + 1) + 1)) {
							a.set(j, a.get(j) - 1);
							a.set(j + 1, a.get(j + 1) + 1);
							sum++;
							m--;
							break;

						}
					}
					if (sum == x && a.get(a.size() - 1) != 1) {
						a.add(1);
						a.set(a.size() - 2, a.get(a.size() - 2) - 1);
						sum++;
						m--;
					}
				}
			if (f) {
				System.out.println("YES");
				x = 1;
				int r=1;
				for (int j = 1; j < a.size(); j++) {
					x=r;
					int w = a.get(j);
					while (w != 0) {
						int e = Math.min(w, 2);
						w -= e;
						while (e-- > 0) {
							System.out.print(x + " ");
						}
						x++;
					}
					r+=a.get(j-1);
				}
				System.out.println();
			} else
				System.out.println("NO");
		}
	}

	static class pair {
		long x;
		int y;

		pair(long r, int t) {
			x = r;
			y = t;
		}

	}
}