#include <bits/stdc++.h>
using namespace std;
vector<int> f[110][110 * 110], bz[110];
int main() {
  for (int i = 4; i < 110; i++) {
    for (int j = 1; j <= i; j++)
      if (j % 2 == 0) bz[i].push_back(j);
    for (int j = 1; j <= i; j++)
      if (j & 1) bz[i].push_back(j);
    if (i & 1) swap(*--bz[i].end(), *--(--bz[i].end()));
  }
  f[1][1] = {1};
  f[2][3] = {1, 2};
  for (int i = 1; i < 110; i++)
    for (int j = 0; j <= i * (i + 1) / 2; j++)
      if (f[i][j].size()) {
        for (int k = 2; k + i - 1 < 110; k++) {
          auto &v = f[i + k - 1][j + k * (k + 1) / 2 - 1];
          if (!v.size()) {
            v = f[i][j];
            if (v.back() == v.size()) reverse(v.begin(), v.end());
            while (v.size() < i + k - 1) v.push_back(v.size() + 1);
          }
        }
        for (int k = 4; k + i - 1 < 110; k++) {
          auto &v = f[i + k - 1][j + k];
          if (!v.size()) {
            for (auto x : bz[k]) {
              if (x == 1) {
                for (auto x : f[i][j]) v.push_back(x);
              } else
                v.push_back(i + x - 1);
            }
          }
        }
      }
  int q, n, k;
  cin >> q;
  while (q--) {
    cin >> n >> k;
    if (!f[n][k].size())
      puts("NO");
    else {
      puts("YES");
      for (auto x : f[n][k]) cout << x << ' ';
      cout << '\n';
    }
  }
}
