#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long double PI = acosl(-1);
const long long infl = 3e18 + 10;
const int inf = 2e9 + 10;
const int nmax = 5e3 + 10;
const int MAXLG = log2(nmax) + 1;
int lo[nmax], hi[nmax];
int pp[nmax];
int cur;
bool dfs(int u, int nodbaki, int dbaki) {
  if (u == 0) return true;
  if (dbaki > hi[nodbaki] or dbaki < lo[nodbaki]) return false;
  dbaki -= nodbaki - 1;
  if (nodbaki == 1) return true;
  for (int i = 0; i <= (nodbaki - 1) / 2; i++) {
    int bame = i, dane = nodbaki - 1 - bame;
    if (lo[bame] + lo[dane] <= dbaki and hi[bame] + hi[dane] >= dbaki) {
      int v1 = 0, v2 = 0;
      if (bame) v1 = ++cur, pp[v1] = u;
      int z = dbaki - lo[bame] - lo[dane];
      int k1 = min(hi[bame], lo[bame] + z);
      int k2 = dbaki - k1;
      dfs(v1, bame, k1);
      if (dane) v2 = ++cur, pp[v2] = u;
      dfs(v2, dane, k2);
      return true;
    }
  }
  return false;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  for (int i = 2; i < nmax; i++) {
    lo[i] = lo[i - 1] + (31 - __builtin_clz(i));
    hi[i] = (i - 1) * i / 2;
  }
  int tc;
  cin >> tc;
  while (tc--) {
    int n, d;
    cin >> n >> d;
    cur = 1;
    bool hobenaki = dfs(1, n, d);
    if (hobenaki) {
      cout << "YES\n";
      for (int i = 2; i <= n; i++) {
        cout << pp[i] << " ";
      }
      cout << "\n";
    } else
      cout << "NO\n";
  }
}
