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:
def read(datatype=int):
    return datatype(input())


def readl(datatype=int):
    return list(map(datatype, input().split()))


def printl(data):
    string = ''
    for d in data:
        string += str(d) + ' '
    print(string)


def testcase():

    # --------------------- start testcase ---------------------

    n, x, y = readl()

    x, y = max(x, y), min(x, y)
    arr = [0 for _ in range(n)]


    best_diff = 1
    best_max = 10 ** 9
    best_start = 1

    for diff in range(1, x - y + 1):

        if (x - y) % diff == 0:
            alpha = (x - y) // diff
            if alpha >= n:
                continue
            elif alpha == n - 1:
                best_diff = diff
                best_start = y
                break
            else:
                left = (y - 1) // diff
                if alpha + left >= n:
                    best_max = x
                    best_diff = diff
                    best_start = y - diff * (n - alpha - 1)
                    break
                else:
                    right = n - alpha - left
                    curr_max = x + diff * right
                    curr_start = y - diff * (n - alpha - right)
                    if curr_max < best_max:
                        best_diff = diff
                        best_max = curr_max
                        best_start = curr_start
    #print('best start, diff', best_start, best_diff)
    arr = [best_start]
    for _ in range(n - 1):
        arr.append(arr[-1] + best_diff)

    printl(arr)



    # --------------------- end testcase -----------------------
    return


t = read()
for _ in range(t):
    testcase()