#include <bits/stdc++.h>
const int N = 668;
const int D = 5000;
int min_d[N + 1], max_d[N + 1];
short from[N + 1][D + 1];
int ans[N + 1];
int CalculateMinD(int n) {
  std::vector<int> d(n);
  d[0] = 0;
  for (int i = 1; i < n; ++i) {
    d[i] = d[(i - 1) / 2] + 1;
  }
  return std::accumulate(d.begin(), d.end(), 0);
}
int CalculateMaxD(int n) { return n * (n - 1) / 2; }
void FillAns(int n, int d, int u, int p) {
  ans[u] = p;
  if (n > 0) {
    int n1 = from[n][d];
    int n2 = n - 1 - n1;
    int d_sum = d - n1 - n2;
    int d1 = std::min(d_sum - min_d[n2], max_d[n1]);
    int d2 = d_sum - d1;
    FillAns(n1, d1, u + 1, u);
    FillAns(n2, d2, u + n1 + 1, u);
  }
}
int main() {
  for (int i = 1; i <= N; ++i) {
    min_d[i] = CalculateMinD(i);
    max_d[i] = CalculateMaxD(i);
  }
  for (int n = 1; n <= N; ++n) {
    for (int d = min_d[n]; d <= std::min(D, max_d[n]); ++d) {
      for (int n1 = 0; n1 < n; ++n1) {
        int n2 = n - 1 - n1;
        int d_sum = d - n1 - n2;
        if (min_d[n1] + min_d[n2] <= d_sum && d_sum <= max_d[n1] + max_d[n2]) {
          from[n][d] = n1;
          break;
        }
      }
    }
  }
  int t;
  std::cin >> t;
  while (t--) {
    int n, d;
    std::cin >> n >> d;
    if (n > N || d < min_d[n] || d > max_d[n]) {
      std::cout << "NO" << std::endl;
      continue;
    }
    FillAns(n, d, 0, -1);
    std::cout << "YES" << std::endl;
    for (int i = 1; i < n; ++i) {
      std::cout << ans[i] + 1 << ' ';
    }
    std::cout << std::endl;
  }
  return 0;
}
