#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, inf = 1e9 + 5;
int n, m;
int d[N], a[N], fa[N];
int main() {
  int t, ans;
  scanf("%d", &t);
  while (t--) {
    scanf("%d %d", &n, &m);
    int sum = n * (n - 1) / 2 - m, l = 2, r = n;
    for (int i = 1; i < n + 1; ++i) d[i] = 1;
    while (sum > 0) {
      while (l < r && (sum - r + l < 0 || d[l] == 1 << (l - 1))) l++;
      if (l >= r) break;
      sum -= r - l;
      d[l] += 1;
      d[r] -= 1;
      if (d[r] == 0) r -= 1;
    }
    if (sum != 0) {
      puts("NO");
      continue;
    }
    puts("YES");
    for (int i = 1; i < n + 1; ++i) a[i] = d[i] + a[i - 1];
    for (int i = 2; i < n + 1; ++i) {
      if (d[i] == 0) break;
      int x = d[i], id = a[i - 1] + 1;
      for (int j = a[i - 2] + 1; j < a[i - 1] + 1; ++j) {
        fa[id] = j;
        --x;
        ++id;
        if (!x) break;
        fa[id] = j;
        --x;
        ++id;
        if (!x) break;
      }
    }
    for (int i = 2; i < n + 1; ++i) printf("%d ", fa[i]);
    puts("");
  }
  return 0;
}
