#include <bits/stdc++.h>
using namespace std;
const int maxn = 5000;
int mi[5001], mx[5001];
int a[maxn + 5];
int n, m;
vector<int> tmp;
void solve() {
  if (m < mi[n] || m > mx[n]) {
    printf("NO\n");
    return;
  }
  printf("YES\n");
  int now = n;
  for (int i = 0; i <= n; ++i) a[i] = 0;
  int d;
  for (d = 0; now >= (1 << d); ++d) a[d] = 1 << d, now -= (1 << d);
  a[d] = now;
  m -= mi[n];
  while (m--) {
    for (int i = d; i >= 0; --i)
      if (a[i + 1] + 1 <= 2 * (a[i] - 1)) {
        ++a[i + 1];
        --a[i];
        if (i == d) ++d;
        break;
      }
  }
  tmp.clear();
  tmp.push_back(1);
  tmp.push_back(1);
  int id = 2;
  for (int i = 1; i <= d; ++i) {
    for (int j = 0; j < a[i]; ++j) printf("%d ", tmp[j]);
    tmp.clear();
    for (int j = id; j < id + a[i]; ++j) tmp.push_back(j), tmp.push_back(j);
    id += a[i];
  }
  printf("\n");
}
int main() {
  mi[1] = 0;
  mx[1] = 0;
  int dep = 1;
  for (int i = 2; i <= 5000; ++i) {
    mi[i] = mi[i - 1] + dep;
    if (i + 1 == (1 << (dep + 1))) ++dep;
    mx[i] = mx[i - 1] + i - 1;
  }
  ios::sync_with_stdio(false);
  cin.tie(0);
  int T;
  cin >> T;
  while (T--) {
    cin >> n >> m;
    solve();
  }
}
