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>
#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  int n, d;
  while (t--) {
    cin >> n >> d;
    int lb = 0, ub = n * (n - 1) / 2;
    int dep = -1;
    for (unsigned int i = 1; i <= n; i++) {
      if (!(i & (i - 1))) dep++;
      lb += dep;
    }
    if (!(lb <= d && d <= ub)) {
      cout << "NO" << endl;
      continue;
    }
    vector<int> par(n);
    iota(par.begin(), par.end(), -1);
    vector<int> son(n, 1);
    son[n - 1] = 0;
    vector<int> bad(n), depth(n);
    iota(depth.begin(), depth.end(), 0);
    int cur = n * (n - 1) / 2;
    while (cur > d) {
      int leaf = -1;
      for (int i = 0; i < n; i++) {
        if (!bad[i] && 0 == son[i] && (-1 == leaf || depth[leaf] > depth[i])) {
          leaf = i;
        }
      }
      int p = -1;
      for (int i = 0; i < n; i++) {
        if (son[i] < 2 && depth[i] == depth[leaf] - 2) {
          p = i;
          break;
        }
      }
      if (-1 == p) {
        bad[leaf] = 1;
        continue;
      }
      son[par[leaf]]--;
      son[p]++;
      par[leaf] = p;
      depth[leaf]--;
      cur--;
    }
    cout << "YES" << endl;
    for (int i = 1; i < n; i++) cout << par[i] + 1 << " ";
    cout << endl;
  }
  return 0;
}
