Problem: We have a secret array. You don't know this array and you have to restore it. However, you know some facts about this array:

  * The array consists of n distinct positive (greater than 0) integers. 
  * The array contains two elements x and y (these elements are known for you) such that x < y. 
  * If you sort the array in increasing order (such that a_1 < a_2 < … < a_n), differences between all adjacent (consecutive) elements are equal (i.e. a_2 - a_1 = a_3 - a_2 = … = a_n - a_{n-1}). 



It can be proven that such an array always exists under the constraints given below.

Among all possible arrays that satisfy the given conditions, we ask you to restore one which has the minimum possible maximum element. In other words, you have to minimize max(a_1, a_2, ..., a_n).

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 100) — the number of test cases. Then t test cases follow.

The only line of the test case contains three integers n, x and y (2 ≤ n ≤ 50; 1 ≤ x < y ≤ 50) — the length of the array and two elements that are present in the array, respectively.

Output

For each test case, print the answer: n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9), where a_i is the i-th element of the required array. If there are several answers, you can print any (it also means that the order of elements doesn't matter).

It can be proven that such an array always exists under the given constraints.

Example

Input


5
2 1 49
5 20 50
6 20 50
5 3 8
9 13 22


Output


1 49 
20 40 30 50 10
26 32 20 38 44 50 
8 23 18 13 3 
1 10 13 4 19 22 25 16 7 

Solution (in PYTHON3):

Solution:
#!/usr/bin/env python3
# encoding: utf-8



#----------
# Constants
#----------



#----------
# Functions
#----------

# The function that solves the task
def calc(n, x, y):
    best_maximum, best_k = 1000000001, 0

    for m in range(1, n):
        k = (y - x) // m
        if m * k != y - x:
            continue

        start = y - k * (n-1)
        delta = 0
        if start <= 0:
            delta = (k - start) // k
            start += delta * k

        if start > x:
            continue
        
        maximum = y + delta * k

        if maximum < best_maximum:
            best_maximum = maximum
            best_k = k

    assert best_k > 0

    res = []
    for i in range(n):
        res.append(best_maximum)
        best_maximum -= best_k

    return res


# Reads a string from stdin, splits it by space chars, converts each
# substring to int, adds it to a list and returns the list as a result.
def get_ints():
    return [ int(n) for n in input().split() ]


# Reads a string from stdin, splits it by space chars, converts each substring
# to floating point number, adds it to a list and returns the list as a result.
def get_floats():
    return [ float(n) for n in input().split() ]


# Converts a sequence to the space separated string
def seq2str(seq):
    return ' '.join(str(item) for item in seq)


#----------
# Execution start point
#----------

if __name__ == "__main__":
    zzz = get_ints()
    assert len(zzz) == 1
    t = zzz[0]

    for i in range(t):
        zzz = get_ints()
        assert len(zzz) == 3
        n, x, y = zzz[0], zzz[1], zzz[2]

        res = calc(n, x, y)
        print(seq2str(res))