def solve(K, M, N):
   M -= 1
   if M == 0:
      return
   from math import gcd
   G = gcd(K, M)
   def gen(x):
      y = x
      while True:
         yield y
         y = (y+M)%K
         if y == x:
            break
   res = []
   for r in range(G):
      lst = list(gen(r))
      if len(lst) in (2, 3):
         res.append(lst[0])
      else:
         res.extend(lst[::3])
   if len(res) >= N:
      res = res[:N]
      return [x+1 for x in res]
   else:
      return
T = int(input())
for _ in range(T):
   K, M, N = map(int, input().split())
   ans = solve(K, M, N)
   if ans is None:
      print("No")
   else:
      print("Yes")
      print(*ans)