#include <bits/stdc++.h>
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    static int dd[5000 + 1], kk[5000];
    int n, s, lower, upper, diff, i, d, h, l, r;
    scanf("%d%d", &n, &s);
    lower = 0, upper = n * (n - 1) / 2;
    memset(kk, 0, n * sizeof *kk);
    dd[1] = 0;
    kk[0]++;
    for (i = 2; i <= n; i++) {
      dd[i] = dd[i / 2] + 1;
      lower += dd[i];
      kk[dd[i]]++;
    }
    if (s < lower || upper < s) {
      printf("NO\n");
      continue;
    }
    diff = s - lower;
    h = n - 1;
    while (kk[h] == 0) h--;
    d = h++;
    while (diff > 0) {
      int d_;
      while (kk[d] == 1) d--;
      d_ = d;
      while (d_ < h && diff > 0) {
        kk[d_]--, kk[d_ + 1]++;
        d_++;
        diff--;
      }
      if (d_ == h) h++;
    }
    printf("YES\n");
    l = 0, r = 1;
    for (d = 1; d < n; d++) {
      for (i = 0; i < kk[d]; i++) printf("%d ", l + i / 2 + 1);
      l = r, r += kk[d];
    }
    printf("\n");
  }
  return 0;
}

### Prompt

Develop a solution in CPP to the problem described below:

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>

### Response

```cpp
#include <bits/stdc++.h>
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    static int dd[5000 + 1], kk[5000];
    int n, s, lower, upper, diff, i, d, h, l, r;
    scanf("%d%d", &n, &s);
    lower = 0, upper = n * (n - 1) / 2;
    memset(kk, 0, n * sizeof *kk);
    dd[1] = 0;
    kk[0]++;
    for (i = 2; i <= n; i++) {
      dd[i] = dd[i / 2] + 1;
      lower += dd[i];
      kk[dd[i]]++;
    }
    if (s < lower || upper < s) {
      printf("NO\n");
      continue;
    }
    diff = s - lower;
    h = n - 1;
    while (kk[h] == 0) h--;
    d = h++;
    while (diff > 0) {
      int d_;
      while (kk[d] == 1) d--;
      d_ = d;
      while (d_ < h && diff > 0) {
        kk[d_]--, kk[d_ + 1]++;
        d_++;
        diff--;
      }
      if (d_ == h) h++;
    }
    printf("YES\n");
    l = 0, r = 1;
    for (d = 1; d < n; d++) {
      for (i = 0; i < kk[d]; i++) printf("%d ", l + i / 2 + 1);
      l = r, r += kk[d];
    }
    printf("\n");
  }
  return 0;
}

```