#include <bits/stdc++.h>
using namespace std;
const long long int inf = 1e18, M = 1e9 + 7;
const long long int N = 5e3 + 10, LN = 16;
vector<long long int> v(N, 0), val(LN);
void compute() {
  val[0] = 1;
  for (long long int i = 1; i < LN; ++i) val[i] = 2ll * val[i - 1];
}
long long int func(long long int n) {
  long long int tmp = n;
  long long int res = 0;
  for (long long int i = 0;; ++i) {
    if (val[i] >= tmp) {
      res += tmp * i;
      break;
    }
    res += i * val[i];
    tmp -= val[i];
  }
  return res;
}
void solve() {
  long long int n, d;
  cin >> n >> d;
  long long int sum = (n * (n - 1)) / 2;
  if (d < func(n) || sum < d) {
    cout << "NO";
    return;
  }
  cout << "YES\n";
  for (long long int i = 0; i < n; ++i) v[i] = 1;
  long long int cur = 1;
  for (long long int i = n - 1; i >= 0; --i) {
    --v[i];
    if (sum - i + cur > d) {
      sum += -i + cur;
      ++v[cur];
      if (v[cur] == val[cur]) ++cur;
    } else {
      long long int tmp = d + i - sum;
      ++v[tmp];
      break;
    }
  }
  long long int cnt;
  sum = 0;
  for (long long int i = 1; i < n && v[i]; ++i) {
    cnt = sum + 1;
    for (long long int j = 0; j < v[i]; ++cnt) {
      if (j == v[i] - 1)
        cout << cnt << " ", ++j;
      else
        cout << cnt << " " << cnt << " ", j += 2;
    }
    sum += v[i - 1];
  }
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  compute();
  long long int t = 1;
  cin >> t;
  while (t--) {
    solve();
    cout << "\n";
  }
  return 0;
}
