#include <bits/stdc++.h>
using namespace std;
int parents[5000];
int leftNeighbor[5000];
int children[5000][2];
void initParents() {
  for (int i = 0; i < 5000; i++) {
    parents[i] = i - 1;
  }
}
void initChildren() {
  for (int i = 0; i < 5000; i++) {
    children[i][0] = i + 1;
    children[i][1] = -1;
  }
}
void initLeftNeighbor() {
  for (int i = 0; i < 5000; i++) {
    leftNeighbor[i] = -1;
  }
}
int getMin(int current, int depthP2, int depthP1) {
  return current - (depthP2) + depthP1 + 1;
}
int main() {
  int T;
  cin >> T;
  for (int t = 0; t < T; t++) {
    int n, d;
    cin >> n >> d;
    int current = ((n - 1) * n) / 2;
    if (d > current) {
      cout << "NO\n";
      continue;
    }
    initParents();
    initChildren();
    children[n - 1][0] = -1;
    children[n - 1][1] = -1;
    initLeftNeighbor();
    int pointer1 = 0;
    int pointer2 = n - 1;
    int dp1 = 0;
    int dp2 = n - 1;
    int firstInRow = 0;
    int previous = -1;
    bool possible = false;
    while (current != d) {
      int minPossible = getMin(current, dp2, dp1);
      if (minPossible >= current) {
        break;
      }
      if (minPossible >= d) {
        int oldParent = parents[pointer2];
        children[parents[pointer2]][0] = -1;
        parents[pointer2] = pointer1;
        int child = children[pointer1][1] == -1 ? 1 : 0;
        children[pointer1][child] = pointer2;
        if (previous != -1) {
          leftNeighbor[previous] = pointer2;
        }
        bool updateP1 =
            children[pointer1][0] != -1 && children[pointer1][1] != -1;
        bool startNewRow = child == 1 && children[pointer1][0] != -1;
        previous = pointer2;
        if (updateP1) {
          if (startNewRow) {
            leftNeighbor[pointer2] = children[pointer1][0];
            pointer1 = children[firstInRow][1];
            firstInRow = pointer1;
            previous = -1;
            dp1++;
          } else {
            pointer1 = leftNeighbor[pointer1];
          }
        }
        current = minPossible;
        pointer2 = oldParent;
        dp2--;
      } else {
        int need = current - d;
        int newParent = parents[pointer2];
        for (int i = 0; i < need; i++) {
          newParent = parents[newParent];
        }
        parents[pointer2] = newParent;
        current = d;
      }
    }
    if (current == d) {
      cout << "YES\n";
      for (int i = 1; i < n; i++) {
        cout << (parents[i] + 1) << " ";
      }
      cout << '\n';
    } else {
      cout << "NO\n";
    }
  }
}
