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 input_int():
    return(int(input()))

def input_int_list():
    return(list(map(int,input().split())))

def input_input_map():
    return(map(int,input().split()))

def run():
    q_num = input_int()

    for i in range(q_num):

        num_count, first_num, second_num = input_input_map()

        diff_num = second_num - first_num

        one_step_num = diff_num

        for num in range(1, diff_num // 2 + 1):
            if diff_num % num == 0 and diff_num / num < num_count:
                one_step_num = num
                break

        # startが分かればいい。

        total_diff = one_step_num * (num_count - 1)

        if second_num - total_diff < 1:

            diff_count = second_num // one_step_num

            if second_num - one_step_num * diff_count == 0:
                start = second_num - one_step_num * (diff_count - 1)
            else:
                start = second_num - one_step_num * diff_count
        else:
            start = second_num - total_diff

        results = []
        for j in range(num_count):
            results.append(start + one_step_num * j)

        print(" ".join(map(str, results)))
        # print("aaa")



run()

# 217871987498122 10
#   2128012501878 10

# 100000000000000001
# 899999999999999999