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:
 
 
#------------------------PYPY3_Template_Start--------------------------#
import os
import sys
import time
from io import BytesIO, IOBase

def localInput():
    sys.stdin = open('inputf.in', 'r')
    sys.stdout = open('outputf.in', 'w')
    sys.stderr = open('error.txt', 'w')

def print_to_stderr(*a):
    print(*a, file = sys.stderr)

BUFSIZE = 8192

class FastIO(IOBase):
    newlines = 0
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)

class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")

sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")

def value():return tuple(map(int,input().split()))
def array():return [int(i) for i in input().split()]
def Int():return int(input())
def Str():return input()
def arrayS():return [i for i in input().split()]


'''
Useful List Methods:

append()        Adds an element at the end of the list
clear()         Removes all the elements from the list
copy()          Returns a copy of the list
count()         Returns the number of elements with the specified value
extend()        Add the elements of a list (or any iterable), to the end of the current list
index()         Returns the index of the first element with the specified value
insert()        Adds an element at the specified position
pop()           Removes the element at the specified position
remove()        Removes the first item with the specified value
reverse()       Reverses the order of the list
sort()          Sorts the list

Useful Dictionary Methods:

clear()         Removes all the elements from the dictionary
copy()          Returns a copy of the dictionary
fromkeys()      Returns a dictionary with the specified keys and value
get()           Returns the value of the specified key
items()         Returns a list containing a tuple for each key value pair
keys()          Returns a list containing the dictionary's keys
pop()           Removes the element with the specified key
popitem()       Removes the last inserted key-value pair
setdefault()    Returns the value of the specified key. If the key does not exist: insert the key, with the specified value
update()        Updates the dictionary with the specified key-value pairs
values()        Returns a list of all the values in the dictionary

Input methods for faster access:

Single line input for multiple variables:  -->>  n,k=map(int, input().split())
Single line array imput:                   -->>  arr = [int(a) for a in input().strip().split(' ')]
Sorting in ascending order:                -->> arr.sort()
Sorting in descending order:               -->> arr.sort(reverse=True)

'''
#-------------------------PYPY3_Template_End---------------------------#

# Uncomment this line to read input from local file.
# Comment this line before making final submission.
#localInput()




def solve():
    n,a,b=map(int, input().split())
    fans=[]
    myfans=[]
    diff=0
    min1=99999999999999999
    for i in range(1,min(a,b)+1):
        for d in range(1, abs(a-b)+1):
            mylist=[]
            for k in range(n):
                mylist.append(i+k*d)
            if a in mylist and b in mylist:
                fans.append(list(mylist))

    for l in fans:
        if l[n-1] < min1:
            min1 = l[n-1]
            myfans=list(l)
                
    print(*myfans)
    


    




def main():
    test_cases=int(input())
    for test_units in range(test_cases):
        solve()

if __name__ == "__main__":
    execution_time_start=time.clock()
    main()
    execution_time_stop=time.clock()
    print_to_stderr("Total Time Taken: %f Seconds!" %(execution_time_stop - execution_time_start))