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;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
constexpr int N = 5e3 + 5;
int n, height[N], m, childs[N], par[N], t;
stack<int> c;
void Solve() {
  cin >> n >> m;
  iota(height, height + n + 1, -1);
  iota(par, par + n + 1, -1);
  fill(childs, childs + n, 1);
  childs[n] = 0;
  c.push(n);
  int sum = n * (n - 1) / 2;
  if (sum < m || n >= (1 << 10)) {
    cout << "NO"
         << "\n";
    return;
  }
  while (sum > m && c.size()) {
    auto ch = c.top();
    c.pop();
    for (int i = 1; i <= n; i++) {
      if (i != ch && height[i] == height[ch] - 2 && childs[i] < 2) {
        childs[par[ch]]--;
        if (childs[par[ch]] == 0) {
          c.push(par[ch]);
        }
        height[ch]--;
        par[ch] = i;
        childs[i]++;
        c.push(ch);
        sum--;
        break;
      }
    }
  }
  if (sum == m) {
    cout << "YES"
         << "\n";
    for (int i = 2; i <= n; i++) cout << par[i] << " ";
  } else
    cout << "NO";
  cout << "\n";
  while (c.size()) c.pop();
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cin >> t;
  while (t--) Solve();
  return 0;
}
