#include <bits/stdc++.h>
using namespace std;
long long N, D, T;
int v[5015];
int v2[5015];
int v3[5015];
void pre() {
  for (int i = 1; (i) <= int(5010); (i)++) {
    v[i + 1] = (i * (i + 1)) / 2;
    v3[i + 1] = i;
  }
  int cont, cont2 = 1, x = 0;
  int valor = 0;
  while (cont2 < 5010) {
    cont = 0;
    valor++;
    int j = 1 << ++x;
    while (cont2++ < 5010 && cont++ < j) {
      v2[cont2] = v2[cont2 - 1] + valor;
    }
    cont2--;
  }
}
void solve() {
  if (D > v[N] || D < v2[N]) {
    cout << "NO"
         << "\n";
    return;
  }
  cout << "YES"
       << "\n";
  multiset<int> ms;
  for (int i = 1; (i) <= int(N); (i)++) {
    ms.insert(v3[i]);
  }
  int cont = v[N];
  while (cont > D) {
    auto it = ms.end();
    it--;
    int aux = *it;
    ms.erase(it);
    int h = 1;
    while (ms.count(h) >= (1 << h)) {
      h++;
    }
    while (cont > D && aux > h) {
      cont--;
      aux--;
    }
    ms.insert(aux);
  }
  int aux;
  vector<int> sol;
  vector<int> altura(N, 0);
  cont = 0;
  for (auto i : ms) {
    cont++;
    if (!i) continue;
    if (!altura[i]) {
      altura[i] = cont;
    }
  }
  for (auto i : ms) {
    if (!i)
      continue;
    else {
      if (i == 1) {
        sol.push_back(1);
        aux = 1;
      } else {
        if (i != aux) cont = 0;
        aux = i;
        int temp = altura[i - 1];
        for (int j = 0; j < cont / 2; j++) {
          temp++;
        }
        sol.push_back(temp);
        cont++;
      }
    }
  }
  for (int i = 0; (i) < int(sol.size() - 1); (i)++) {
    cout << sol[i] << " ";
  }
  cout << sol[(long long)(sol.size()) - 1] << "\n";
}
int main() {
  cin >> T;
  pre();
  while (T--) {
    cin >> N >> D;
    solve();
  }
  return 0;
}
