# https://www.hackerrank.com/challenges/bonetrousle

def calc(n, k, b):
    if n > (k - b + 1 + k) * b / 2:
        print -1
        return
   
    res = [n / b for _ in range(b)]
    for i in range(b / 2):
        res[i] -= b / 2 - i
    for i in range(b / 2, b):
        res[i] += i - b / 2
    diff = n - sum(res)
    
    while diff > 0:
        for i in range(b - 1, -1, -1):
            if diff == 0:
                break
            res[i] += 1
            if res[i] > k:
                print -1
                return
            diff -= 1
            
    for i in xrange(1, len(res)):
        if res[i] == res[i-1]:
            print -1
            return
    
    print ' '.join(map(str, res)) if res[0] >= 1 else -1

for _ in range(int(raw_input())):
    n, k, b = map(int, raw_input().split())
    calc(n, k, b)

11de5a4dfbe123777d63ffac0827f353c79aa2a3
# https://www.hackerrank.com/challenges/bonetrousle

def calc(n, k, b):
    if n > (k - b + 1 + k) * b / 2:
        print -1
        return
   
    res = [n / b for _ in range(b)]
    for i in range(b / 2):
        res[i] -= b / 2 - i
    for i in range(b / 2, b):
        res[i] += i - b / 2
    diff = n - sum(res)
    
    while diff > 0:
        for i in range(b - 1, -1, -1):
            if diff == 0:
                break
            res[i] += 1
            if res[i] > k:
                print -1
                return
            diff -= 1
            
    for i in xrange(1, len(res)):
        if res[i] == res[i-1]:
            print -1
            return
    
    print ' '.join(map(str, res)) if res[0] >= 1 else -1

for _ in range(int(raw_input())):
    n, k, b = map(int, raw_input().split())
    calc(n, k, b)
