#include <bits/stdc++.h>
const int maxn = 105;
int C(int x) { return x * (x + 1) / 2; }
inline void swap(int &x, int &y) { x ^= y ^= x ^= y; }
int T, n, k, cnt, a[maxn], dp[maxn][maxn * maxn];
void cstr(int l, int r, int k, bool dir) {
  int len = r - l + 1;
  if (C(len) == k) {
    if (dir == 0)
      for (int i = l; i <= r; ++i) a[i] = ++cnt;
    else
      for (int i = r; i >= l; --i) a[i] = ++cnt;
    return;
  }
  for (int s = 2; s <= len; ++s) {
    if (k < C(s) || !dp[len - s + 1][k - C(s) + 1]) continue;
    if (dir == 0) {
      cstr(l, r - s + 1, k - C(s) + 1, 1);
      for (int i = r - s + 2; i <= r; ++i) a[i] = ++cnt;
    } else {
      cstr(l + s - 1, r, k - C(s) + 1, 0);
      for (int i = l + s - 2; i >= l; --i) a[i] = ++cnt;
    }
    return;
  }
  for (int s = 4; s <= len; ++s) {
    if (k < s || !dp[len - s + 1][k - s]) continue;
    if (dir == 0) {
      for (int i = r - s + 2; i <= r; i += 2) a[i] = ++cnt;
      cstr(l, r - s + 1, k - s, 0);
      for (int i = r - s + 3; i <= r; i += 2) a[i] = ++cnt;
      if (a[r] == cnt) swap(a[r], a[r - 2]);
    } else {
      for (int i = l + s - 2; i >= l; i -= 2) a[i] = ++cnt;
      cstr(l + s - 1, r, k - s, 0);
      for (int i = l + s - 3; i >= l; i -= 2) a[i] = ++cnt;
      if (a[l] == cnt) swap(a[l], a[l + 2]);
    }
    return;
  }
}
int main() {
  dp[1][1] = 1;
  for (int i = 1; i <= 100; ++i)
    for (int j = 1; j <= 5050; ++j) {
      if (!dp[i][j]) continue;
      for (int k = 2; i + k - 1 <= 100; ++k) dp[i + k - 1][j + C(k) - 1] = 1;
      for (int k = 4; i + k - 1 <= 100; ++k) dp[i + k - 1][j + k] = 1;
    }
  scanf("%d", &T);
  while (T--) {
    scanf("%d %d", &n, &k);
    if (!dp[n][k])
      puts("NO");
    else {
      puts("YES"), cnt = 0, cstr(1, n, k, 0);
      for (int i = 1; i <= n; ++i) printf("%d%c", a[i], "\n "[i < n]);
    }
  }
  return 0;
}
