import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int[][] solve(int N, int K) {
  if (K == 1 || K == N) return null;
  auto a = new int[][](3, N);
  int val;
  foreach_reverse (i; 0 .. N - K + 1) a[0][i] = ++val;
  foreach (i; N - K + 1 .. N - 1) a[0][i] = ++val;
  foreach_reverse (i; 0 .. N - K + 1) a[1][i] = ++val;
  foreach (i; N - K + 1 .. N - 1) a[1][i] = ++val;
  a[2][N - 1] = a[0][0];
  foreach_reverse (i; K .. N - 1) a[2][i] = ++val;
  foreach (i; 0 .. K) a[2][i] = ++val;
  a[0][N - 1] = a[1][0];
  a[1][N - 1] = a[2][0];
  return a;
}

void main() {
  debug {{
    foreach (N; 2 .. 10 + 1) {
      foreach (K; 1 .. N + 1) {
        writeln(N, " ", K, ": ", solve(N, K));
      }
    }
  }}
  
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const N = readInt;
        const K = readInt;
        
        const ans = solve(N, K);
        if (ans) {
          writeln("Yes");
          foreach (h; 0 .. 3) {
            foreach (i; 0 .. N) {
              if (i) write(" ");
              write(ans[h][i]);
            }
            writeln;
          }
        } else {
          writeln("No");
        }
      }
    }
  } catch (EOFException e) {
  }
}