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 JAVA):

Solution:
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedHashMap;
import java.util.LinkedHashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Random;
import java.util.Scanner;
import java.util.Set;
import java.util.SortedSet;
import java.util.Stack;
import java.util.TreeSet;
import java.util.Vector;
import java.util.concurrent.ThreadLocalRandom;

public class CodeForces {

	static class Range {

		String s;

		public Range(String s) {
			this.s = s;
		}

		@Override
		public String toString() {
			return s;
		}
	}

	static class RangeComparator implements Comparator<Range> {

		public int compare(Range o1, Range o2) {
			String[] v1 = o1.s.split("#");
			String[] v2 = o2.s.split("#");
			int val1 = Integer.parseInt(v1[1]) - Integer.parseInt(v1[0]);
			int val2 = Integer.parseInt(v2[1]) - Integer.parseInt(v2[0]);
			if (val1 > val2) {
				return -1;
			} else if (val2 > val1) {
				return 1;
			}
			return o1.s.compareTo(o2.s);
		}

	}

	public static void printArray(int[] arr) {
		for (int i = 0; i < arr.length; i++) {
			System.out.print(arr[i] + " ");
		}
		System.out.println();
	}

	public static int[] getIntArray(BufferedReader br) throws IOException {
		String line = br.readLine();
		String[] values = line.split(" ");
		int[] arr = new int[values.length];
		for (int i = 0; i < values.length; i++) {
			arr[i] = Integer.parseInt(values[i]);
		}
		return arr;
	}

	public static long[] getLongArray(BufferedReader br) throws IOException {
		String line = br.readLine();
		String[] values = line.split(" ");
		long[] arr = new long[values.length];
		for (int i = 0; i < values.length; i++) {
			arr[i] = Long.parseLong(values[i]);
		}
		return arr;
	}

	public static Set<Integer> getFactors(int n) {
		Set<Integer> set = new HashSet<>();
		for (int i = 2; i <= Math.sqrt(n); i++) {
			if (n % i == 0) {
				set.add(i);
				set.add(n / i);
			}
		}
		return set;
	}

	public static int[] decode(String s) {
		String[] v = s.split("#");
		int[] arr = new int[2];
		arr[0] = Integer.parseInt(v[0]);
		arr[1] = Integer.parseInt(v[1]);
		return arr;
	}

	public static String encode(int a, int b) {
		return a + "#" + b;
	}

	public static long lcm(long a, long b) {
		BigInteger bigGCD = BigInteger.valueOf(a).gcd(BigInteger.valueOf(b));
		long val = bigGCD.longValue();
		long prod = a * b;
		return prod / val;
	}

	public static Set<Integer> getPrimes() {
		Set<Integer> primes = new HashSet<>();
		for (int i = 2; i < 20000; i++) {
			int fac = 0;
			for (int j = 1; j <= Math.sqrt(i); j++) {
				if (i % j == 0) {
					fac += 2;
				}
			}

			if (fac == 2) {
				primes.add(i);
			}
		}

		System.out.println(primes.size());

		return primes;
	}
	
	public static String solve(String s){
		int max =0;
		int count=0;
		for(int i=0;i<s.length();i++){
			if(s.charAt(i)=='1'){
				count++;
			}else{
				count=0;
			}
			if(count>max){
				max =count;
			}
		}
		
		String temp ="";
		for(int i=0;i<max;i++){
			temp+="1";
		}
		
		s= s.replaceFirst(temp, "");
		return s;
	}
	
	public static BigInteger binpow(BigInteger a, int b) {
	    if (b == 0)
	        return new BigInteger("1");
	    if(b==1){
	    	return a;
	    }
	    BigInteger res = binpow(a, (b / 2));
	    if (b % 2!=0){
	    	return res.multiply(res).multiply(a);
	    }else{
	    	return res.multiply(res);
	    }
	}
	
	public static BigInteger compute(long val,long[] arr){
		BigInteger b1 = new BigInteger(String.valueOf(val));
		BigInteger ans = new BigInteger("0");
		
		for(int i=0;i<arr.length;i++){
			
			BigInteger b2 = binpow(b1,i);
			BigInteger diff = b2.subtract(new BigInteger(String.valueOf(arr[i])));
			diff = diff.abs();
			ans = ans.add(diff);
		}
		return ans;
	}
	
	public static void comp(long val,long sum,int n){
		long op = (long)(val * (1- Math.pow((double)val, (double)n)))/(1-n);
		System.out.println(op);
	}
	
	public static long checker(long val,long x,long y,long n){
		Set<Long> set = new HashSet<>();
		for(long i=x;i<=y;i=i+val){
			set.add(i);
		}
		if(set.size()>n){
			return -1;
		}
		if(set.size()==n){
			return y;
		}
		for(long i=x;i>0;i=i-val){
			set.add(i);
			if(set.size()==n){
				return y;
			}
		}
		
		for(long i=y;i<=5000;i=i+val){
			set.add(i);
			if(set.size()==n){
				return i;
			}
		}
		
		return -1l;
	}
	
	public static Set<Long> computer(long val,long x,long y,long n){
		Set<Long> set = new HashSet<>();
		for(long i=x;i<=y;i=i+val){
			set.add(i);
		}
		if(set.size()==n){
			return set;
		}
		for(long i=x;i>0;i=i-val){
			set.add(i);
			if(set.size()==n){
				return set;
			}
		}
		
		for(long i=y;i<=5000;i=i+val){
			set.add(i);
			if(set.size()==n){
				return set;
			}
		}
		
		return set;
	}

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String line = br.readLine();
		int t = Integer.parseInt(line);

		while (t-- > 0) {
			long[] arr = getLongArray(br);
			long n = arr[0];
			long x = arr[1];
			long y = arr[2];
			
			if(n==2){
				System.out.println(x+" "+y);
			}else{
				
				long diff = y-x;
				
				long max = Long.MAX_VALUE;
				long max_val = -1;
				
				for(long i=(long) Math.sqrt(diff);i>=1;i--){
					if(diff%i==0){
						long fact1 = i;
						long fact2 = diff/i;
						long v1 = checker(fact1, x, y, n);
						long v2 = checker(fact2, x, y, n);
						if(v1!=-1 && v1<max){
							max = v1;
							max_val = fact1;
						}
						
						if(v2!=-1 && v2<max){
							max = v2;
							max_val = fact2;
						}
						
					}
				}
				
				Set<Long> ans = computer(max_val,x,y,n);
//				System.out.println(max_val);
				
				for(long v: ans){
					System.out.print(v+" ");
				}
				System.out.println();
				
				
				
			}



			
		}
			

		}

}