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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int t;
  cin >> t;
  while (t--) {
    long long int n, d;
    cin >> n >> d;
    long long int Max = (n * (n - 1)) / 2;
    long long int Min = 0;
    long long int curr_depth = 0;
    for (long long int i = 1; i <= n; i++) {
      if (!(i & (i - 1))) {
        curr_depth++;
      }
      Min += curr_depth - 1;
    }
    if (!(d >= Min && d <= Max)) {
      cout << "NO"
           << "\n";
      continue;
    }
    vector<long long int> children(n, 1);
    children[n - 1] = 0;
    vector<long long int> depth(n);
    for (long long int i = 0; i < n; i++) {
      depth[i] = i;
    }
    vector<long long int> par(n);
    for (long long int i = 0; i < n; i++) {
      par[i] = i - 1;
    }
    vector<long long int> bad(n, 0);
    long long int D = (n * (n - 1)) / 2;
    while (D > d) {
      long long int v = -1;
      for (long long int i = 0; i < n; i++) {
        if (children[i] == 0 && !bad[i] && (v == -1 || depth[i] < depth[v])) {
          v = i;
        }
      }
      long long int p = -1;
      for (long long int i = 0; i < n; i++) {
        if (children[i] < 2 && depth[v] - depth[i] >= 2 &&
            (p == -1 || depth[i] > depth[p])) {
          p = i;
        }
      }
      if (p == -1) {
        bad[v] = 1;
        continue;
      }
      depth[v]--;
      children[par[v]]--;
      children[p]++;
      par[v] = p;
      D--;
    }
    cout << "YES"
         << "\n";
    for (long long int i = 1; i < n; i++) {
      cout << par[i] + 1 << " ";
    }
    cout << "\n";
  }
}