#include <bits/stdc++.h>
using namespace std;
long long read() {
  long long x = 0, f = 0;
  char ch = getchar();
  while (!isdigit(ch)) f = ch == '-', ch = getchar();
  while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
  return f ? -x : x;
}
const int N = 105;
int a[N];
int dp[N][N * N];
void prework() {
  int n = N - 5;
  dp[1][0] = 1;
  for (int i = (1); i <= (n); i++)
    for (int j = (0); j <= (i * (i - 1) / 2); j++)
      if (dp[i][j]) {
        for (int k = (1); k <= (n - i); k++) {
          dp[i + k][j + (k + 1) * k / 2] = i;
          if (k >= 3) dp[i + k][j + 1] = -i;
        }
      }
}
void Solve() {
  int n = read(), k = read();
  k -= n;
  if (k < 0 || !dp[n][k]) return (void)puts("NO");
  for (int i = (1); i <= (n); i++) a[i] = i;
  for (int i = n, j; i > 1; i = j) {
    j = dp[i][k];
    if (j > 0) {
      reverse(a + i, a + n + 1);
      k -= (i - j) * (i - j + 1) / 2;
    } else {
      k--;
      j = abs(j);
      int len = n - i + 1;
      int m = i - j + 1;
      int Lp = j + m / 2, Rp = Lp + len - 1;
      for (int p = (Lp); p <= (Rp); p++) a[p] = a[p - Lp + i];
      for (int v = (1); v <= (m - 1); v++)
        if (v & 1)
          a[--Lp] = v + j - 1;
        else
          a[++Rp] = v + j - 1;
    }
  }
  puts("YES");
  for (int i = (1); i <= (n); i++) printf("%d ", a[i]);
  puts("");
}
int main() {
  prework();
  int T = read();
  while (T--) Solve();
  return 0;
}
