#include <bits/stdc++.h>
using namespace std;
const long long N = 5005;
long long T, n, d, mx[N], mn[N], f[N];
void dfs(long long tot, long long off, long long sum) {
  for (long long i = 0; i < tot; i++) {
    long long lsiz = i, rsiz = tot - 1 - i;
    long long vmin = mn[lsiz] + mn[rsiz] + tot - 1;
    long long vmax = mx[lsiz] + mx[rsiz] + tot - 1;
    if (vmin <= sum && sum <= vmax) {
      long long tmp = mn[lsiz];
      if (mn[lsiz] + mx[tot - 1 - lsiz] + tot - 1 < sum)
        tmp = sum - tot + 1 - mx[tot - 1 - lsiz];
      if (lsiz) {
        f[off + 1] = off;
        dfs(lsiz, off + 1, tmp);
      }
      if (rsiz) {
        f[off + 1 + lsiz] = off;
        dfs(rsiz, off + 1 + lsiz, sum - tot + 1 - tmp);
      }
      return;
    }
  }
}
signed main() {
  ios::sync_with_stdio(false);
  for (long long i = 1; i <= 5000; i++) {
    mx[i] = i * (i - 1) / 2;
    mn[i] = mn[i - 1] + (long long)(log2(i) + 1e-7);
  }
  cin >> T;
  while (T--) {
    cin >> n >> d;
    if (d < mn[n] || d > mx[n])
      cout << "NO" << endl;
    else {
      cout << "YES" << endl;
      dfs(n, 1, d);
      for (long long i = 2; i <= n; i++) cout << f[i] << " ";
      cout << endl;
    }
  }
}
