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;
const int MAXN = 2e5 + 7, INF = 1e9;
const long long MOD = 1e9 + 7;
int t, n, d, cur, now_on, new_dad;
int low_bound, high_bound;
void HighIt() {
  low_bound = 0;
  int depth = 0;
  for (int i = 1; i < n + 1; i++) {
    if (!(i & (i - 1))) depth++;
    low_bound += depth - 1;
  }
  return;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
  while (t--) {
    cin >> n >> d;
    high_bound = n * (n - 1) >> 1;
    HighIt();
    if (d < low_bound || d > high_bound) {
      cout << "NO" << endl;
      continue;
    }
    vector<int> bad(n);
    vector<int> par(n);
    iota(par.begin(), par.end(), -1);
    vector<int> dep(n);
    iota(dep.begin(), dep.end(), 0);
    vector<int> cnt(n, 1);
    cnt[n - 1] = 0;
    int cur = high_bound;
    while (cur > d) {
      now_on = -1;
      for (int i = 0; i < n; i++)
        if (!bad[i] && cnt[i] == 0 && (now_on == -1 || dep[now_on] > dep[i]))
          now_on = i;
      new_dad = -1;
      for (int i = 0; i < n; i++) {
        if (cnt[i] < 2 && dep[i] < dep[now_on] - 1 &&
            (new_dad == -1 || dep[new_dad] < dep[i]))
          new_dad = i;
      }
      if (new_dad == -1) {
        bad[now_on] = 1;
        continue;
      }
      cnt[par[now_on]]--;
      dep[now_on]--;
      cnt[new_dad]++;
      par[now_on] = new_dad;
      cur--;
    }
    cout << "YES" << endl;
    for (int i = 1; i < n; i++) cout << par[i] + 1 << ' ';
    cout << endl;
  }
}
