#include <bits/stdc++.h>
using namespace std;
const int MAX = 5e3 + 10;
int T, N, D;
int num[MAX], ans[MAX];
void solve() {
  if (D > (N - 1) * N / 2) {
    printf("NO\n");
    return;
  }
  memset(num, 0, sizeof(num));
  num[0] = 1;
  for (int i = 2; i <= N; i++)
    for (int j = 1; j <= N; j++)
      if (num[j] < 2 * num[j - 1]) {
        num[j]++;
        D -= j;
        break;
      }
  if (D < 0) {
    printf("NO\n");
    return;
  }
  while (D--) {
    for (int i = 1; i <= N; i++)
      if (num[i] < 2 * (num[i - 1] - 1)) {
        num[i]++, num[i - 1]--;
        break;
      }
  }
  printf("YES\n");
  int tot = 1, now = 1;
  for (int i = 1; i <= N; i++) {
    int pre = now + 1;
    for (int j = 0; j < num[i]; j++) ans[++now] = tot + j / 2;
    tot = pre;
  }
  for (int i = 2; i <= N; i++) printf("%d%s", ans[i], i == N ? "\n" : " ");
}
int main() {
  scanf("%d", &T);
  while (T--) {
    scanf("%d%d", &N, &D);
    solve();
  }
  return 0;
}
