from math import gcd


def solve():
    k, m, n = map(int, input().split())
    m -= 1
    g = gcd(k, m)
    ma = (k // g) // 2 * 2 * g
    if ma < 2 * n:
        print("No")
        return

    print("Yes")
    used = [False] * k

    A = []
    for i in range(k):
        if used[i]:
            continue
        x = i
        while not used[x] and not used[(x + m) % k]:
            A.append(x + 1)
            used[x] = True
            used[(x + m) % k] = True
            x = (x + m * 2) % k

    A = A[:n]
    print(*A)


for _ in range(int(input())):
    solve()