read_line.to_i.times do
  solve()
end

def solve
  n, k = read_line.split.map(&.to_i)
  if k == 1 || k == n
    puts "No"
    return
  end
  puts "Yes"
  a = Array.new(n, 0)
  b = Array.new(n, 0)
  c = Array.new(n, 0)
  a[-1] = b[0] = 3 * n - 3
  b[-1] = c[0] = 3 * n - 4
  c[-1] = a[0] = 3 * n - 5
  a[1...-1] = 3.step(to: 3 * n - 6, by: 3).each_slice(k - 1).to_a.reverse.flatten
  b[1...-1] = 2.step(to: 3 * n - 6, by: 3).each_slice(k - 1).to_a.reverse.flatten
  c[1...-1] = 1.step(to: 3 * n - 6, by: 3).each_slice(k - 1).to_a.reverse.flatten
  puts a.join(" ")
  puts b.join(" ")
  puts c.join(" ")
end