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.*;
import java.util.*;

/*
Shortcut Commands

makeali  : Make ArrayList of Integer
makesti : Make Stack of Integer
makeqi : Make Queue of Integer
makepqi : Make PriorityQueue of Integer

makestc : Make Stack of Character

mapii : Make Map<Integer,Integer>
mappi : Make Map<Pair,Integer>

print
println
printf

*/

public class C{

    public static int find(int d,int x,int y,int n){
        int between = (y-x)/d -1;
        if(between+2>n)
        return Integer.MAX_VALUE;

        int below=Math.max(0,x/d-1);
        if(between+below+2>=n)
        return y;


        int left=n-between-below-2;
        // System.out.println(between+","+below+","+left);
        int max=y;
        while(left!=0){
            max+=d;
            left--;
        }
        return max;
    }

    public static List<Integer> helper(int diff){
        List<Integer> arr =new ArrayList<>();
        for(int i=diff;i>=1;i--){
            if(diff%i==0)
            arr.add(i);
        }
        return arr;
    }

	public static void solve()throws IOException{
        int n=sc.nextInt();
        int x=sc.nextInt();
        int y=sc.nextInt();

        int diff = y-x;
        List<Integer> arr  = helper(diff);
        // System.out.println(arr);
        int res=Integer.MAX_VALUE;
        int ans=diff;

        for(int d : arr){
            int max=find(d,x,y,n);
            // System.out.println(d+","+max);
            if(max==y){
                ans=d;
                break;
            }

            if(max<res){
                res=max;
                ans=d;
            }    
        }
        // System.out.println("res : "+ans);
        int count=0;
        for(int i=x;i<=y;i+=ans){
            System.out.print(i+" ");
            count++;
        }

        for(int i=x-ans;i>=1 && count<n;i-=ans){
            System.out.print(i+" ");
            count++;
        }

        for(int i=y+ans;count<n;i+=ans){
            System.out.print(i+" ");
            count++;
        }
	}

	public static void main(String args[])throws IOException{
		int t = sc.nextInt();
		for(int i=1;i<=t;i++){
			solve();
			System.out.println();
		}
    }
    
    public static void sort(int[] arr,boolean reverse){
        ArrayList<Integer> list = new ArrayList<Integer>();
        int n =arr.length;
        for(int i=0;i<n;i++){
            list.add(arr[i]);
        }

        if(reverse)
        Collections.sort(list,Collections.reverseOrder());
        else
        Collections.sort(list);

        for(int i=0;i<n;i++){
            arr[i] = list.get(i);
        }
    }

    static class Graph{
        int n;
        ArrayList<Integer>[] g;

        Graph(int n){
            this.n = n;
            this.g = new ArrayList[n];
            for(int i=0;i<n;i++){
                this.g[i] = new ArrayList<Integer>();
            }
        }

        ArrayList<Integer> get(int i){
			return this.g[i];
		}

        void add(int a,int b){
            this.g[a].add(b);
        }
    }

    static class Pair{

        // Implementing equals() and hashCode()
        // Map<Pair, V> map = //...

        private final int x;
        private final int y;

        public Pair(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public boolean equals(Object o) {
            if (this == o) return true;
            if (!(o instanceof Pair)) return false;
            Pair pair = (Pair) o;
            return x == pair.x && y == pair.y;
        }

        @Override
        public int hashCode() {
            int result = x;
            result = 31 * result + y;
            return result;
        }
    }

	static FastScanner sc = new FastScanner();

	static class FastScanner {
			BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
			StringTokenizer st=new StringTokenizer("");
			String next() {
				while (!st.hasMoreTokens())
					try {
						st=new StringTokenizer(br.readLine());
					} catch (IOException e) {
						e.printStackTrace();
					}
				return st.nextToken();
			}
			
			int nextInt() {
				return Integer.parseInt(next());
			}
			int[] readArray(int n) {
				int[] a=new int[n];
				for (int i=0; i<n; i++) a[i]=nextInt();
				return a;
			}
			long nextLong() {
				return Long.parseLong(next());
			}
			public long[] readLongArray(int n) {
				long[] a=new long[n];
				for (int i=0; i<n; i++) a[i]=nextLong();
				return a;
			}
	}
}