#include <bits/stdc++.h>
using namespace std;
const int N = 102, M = 5107;
int p[N], f1[N][M], f2[N][M];
inline void solve(int l, int r, int ql, int qr, int a, int b, bool rev) {
  if (l == r) {
    p[ql] = l;
    return;
  }
  if (f2[a][b] == 1) {
    int g[N];
    g[0] = 0;
    if (rev == 0)
      for (int i = 1; i <= f1[a][b]; i++) g[++g[0]] = i;
    if (rev == 1)
      for (int i = 1; i <= f1[a][b]; i++) g[++g[0]] = f1[a][b] - i + 1;
    int x = a - f1[a][b] + 1, v = l + x - 1;
    for (int i = 1; i <= g[0]; i++) {
      if (g[i] == 1)
        solve(l, v, ql, ql + x - 1, x, b - f1[a][b] * (f1[a][b] + 1) / 2 + 1,
              rev ^ 1),
            ql += x;
      else
        solve(v + g[i] - 1, v + g[i] - 1, ql, ql, 1, 0, rev), ql++;
    }
  }
  if (f2[a][b] == 2) {
    int g[N];
    g[0] = 0;
    int x = a - f1[a][b] + 1, v = l + x - 1;
    for (int i = 2; i <= f1[a][b]; i += 2) g[++g[0]] = i;
    for (int i = 1; i <= f1[a][b]; i += 2) g[++g[0]] = i;
    if (g[0] % 2 == 1) swap(g[g[0]], g[g[0] - 1]);
    if (rev) {
      for (int i = 1; i <= g[0]; i++) g[i] = g[0] - g[i] + 1;
    }
    for (int i = 1; i <= g[0]; i++) {
      if (g[i] == 1)
        solve(l, v, ql, ql + x - 1, x, b - f1[a][b], rev ^ 1), ql += x;
      else
        solve(v + g[i] - 1, v + g[i] - 1, ql, ql, 1, 0, rev), ql++;
    }
  }
}
int main() {
  f1[1][1] = -1;
  for (int i = 1; i <= 100; i++)
    for (int j = 1; j <= i * (i + 1) / 2; j++)
      if (f1[i][j]) {
        for (int k = 2; k + i <= 101; k++)
          f1[i + k - 1][j + k * (k + 1) / 2 - 1] = k,
                                              f2[i + k - 1]
                                                [j + k * (k + 1) / 2 - 1] = 1;
        for (int k = 4; k + i <= 101; k++)
          f1[i + k - 1][j + k] = k, f2[i + k - 1][j + k] = 2;
      }
  int n, m, t;
  cin >> t;
  while (t--) {
    cin >> n >> m;
    if (f1[n][m]) {
      puts("YES");
      solve(1, n, 1, n, n, m, 0);
      for (int i = 1; i <= n; i++) printf("%d ", p[i]);
      cout << endl;
    } else
      puts("NO");
  }
}
