#include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
int a[maxn], n, k, q, cnt, c2[maxn];
bool f[maxn][maxn * maxn];
void dfs(int l, int r, int k, bool o) {
  int le = r - l + 1;
  if (k == c2[le]) {
    for (register int i = o ? r : l; o ? i >= l : i <= r; o ? i-- : i++)
      a[i] = ++cnt;
    return;
  }
  for (register int i = 2; i < le; i++) {
    if (k <= c2[i] || !f[le - i + 1][k - c2[i] + 1]) continue;
    dfs(o ? l + i - 1 : l, o ? r : r - i + 1, k - c2[i] + 1, o ^ 1);
    for (register int j = o ? l + i - 2 : r - i + 2; o ? j >= l : j <= r;
         o ? j-- : j++)
      a[j] = ++cnt;
    return;
  }
  for (register int i = 4; i <= le; i++) {
    if (k <= i || !f[le - i + 1][k - i]) continue;
    for (register int j = r - i + 2; j <= r; j += 2) a[j] = ++cnt;
    dfs(l, r - i + 1, k - i, 0);
    for (register int j = r - i + 3; j <= r; j += 2) a[j] = ++cnt;
    if (i & 1) swap(a[r - 2], a[r]);
  }
}
int main() {
  for (register int i = 1; i < maxn; i++) c2[i] = i * (i + 1) / 2;
  f[0][0] = 1;
  for (register int i = 1; i < maxn; i++) f[i][c2[i]] = 1;
  for (register int i = 4; i < maxn; i++) f[i][i + 1] = 1;
  for (register int i = 2; i < maxn; i++)
    for (register int j = 1; j <= c2[i]; j++) {
      if (!f[i][j]) continue;
      for (register int k = 2; k < maxn - i; k++)
        f[i + k - 1][j + c2[k] - 1] = 1;
      for (register int k = 4; k < maxn - i; k++) f[i + k - 1][j + k] = 1;
    }
  scanf("%d", &q);
  while (q--) {
    scanf("%d%d", &n, &k);
    if (!f[n][k])
      puts("NO");
    else {
      puts("YES"), cnt = 0, dfs(1, n, k, 0);
      for (register int i = 1; i <= n; i++) printf("%d%c", a[i], " \n"[i == n]);
    }
  }
}
