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


public class test1{

    public static void main(String[] args) throws IOException{
        long startTime = System.currentTimeMillis();
        Reader sc = new Reader();
        int t = sc.nextInt();
        while(t-- > 0){
            int n =sc.nextInt();
			int x =sc.nextInt();
			int y =sc.nextInt();
			
			int diff=y-x;
			int rootDiff = (int)Math.sqrt(diff);
			List<Integer> result=new ArrayList<>();
			for(int i=1; i<=diff ; i++){
				// System.out.println("i "+i);
				if(diff%i==0){
					int divisor=i;
					int count=n;
					int yval=y;
					boolean xPresent=false;
					while(count>0 && yval>0){
						count--;
						if(yval==x)
							xPresent=true;
						yval-=divisor;
					}
					if(!xPresent)
						continue;
					else{
						for(int j=0; j<n && y>0; y-=divisor, j++){
							result.add(y);
						}
						int latest=result.get(0);
						while(count>0){
							result.add(latest+divisor);
							latest=result.get(result.size()-1);
							count--;
						}
					}
				}
			}		
			for(int h:result)
				System.out.print(h+" ");
			System.out.println();
			result.clear();
			// long result=a*b;
			// System.out.println(result);
			
        }   
        long endTime = System.currentTimeMillis();
        //System.out.println("Total execution time: " + (endTime - startTime));
    }

    static class Reader {
	    final private int BUFFER_SIZE = 1 << 16;
	    private DataInputStream din;
	    private byte[] buffer;
	    private int bufferPointer, bytesRead;

	    public Reader() {
	      din = new DataInputStream(System.in);
	      buffer = new byte[BUFFER_SIZE];
	      bufferPointer = bytesRead = 0;
	    }

	    public Reader(String file_name) throws IOException {
	      din = new DataInputStream(new FileInputStream(file_name));
	      buffer = new byte[BUFFER_SIZE];
	      bufferPointer = bytesRead = 0;
	    }

	    public String readLine() throws IOException {
	      byte[] buf = new byte[64];
	      int cnt = 0, c;
	      while ((c = read()) != -1) {
	        if (c == '\n') break;
	        buf[cnt++] = (byte) c;
	      }
	      return new String(buf, 0, cnt);
	    }

	    public int nextInt() throws IOException {
	      int ret = 0;
	      byte c = read();
	      while (c <= ' ') c = read();
	      boolean neg = (c == '-');
	      if (neg) c = read();
	      do {
	        ret = ret * 10 + c - '0';
	      } while ((c = read()) >= '0' && c <= '9');
	      if (neg) return -ret;
	      return ret;
	    }

	    public long nextLong() throws IOException {
	      long ret = 0;
	      byte c = read();
	      while (c <= ' ') c = read();
	      boolean neg = (c == '-');
	      if (neg) c = read();
	      do {
	        ret = ret * 10 + c - '0';
	      } while ((c = read()) >= '0' && c <= '9');
	      if (neg) return -ret;
	      return ret;
	    }

	    public double nextDouble() throws IOException {
	      double ret = 0, div = 1;
	      byte c = read();
	      while (c <= ' ') c = read();
	      boolean neg = (c == '-');
	      if (neg) c = read();
	      do {
	        ret = ret * 10 + c - '0';
	      } while ((c = read()) >= '0' && c <= '9');
	      if (c == '.')
	        while ((c = read()) >= '0' && c <= '9') ret += (c - '0') / (div *= 10);
	      if (neg) return -ret;
	      return ret;
	    }

	    private void fillBuffer() throws IOException {
	      bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
	      if (bytesRead == -1) buffer[0] = -1;
	    }

	    private byte read() throws IOException {
	      if (bufferPointer == bytesRead) fillBuffer();
	      return buffer[bufferPointer++];
	    }

	    public void close() throws IOException {
	      if (din == null) return;
	      din.close();
	    }
	  }
}