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:
//  package com.company;
 import java.math.BigInteger;
 import java.util.*;
 import java.io.*;
 import java.lang.*;

 public class Main{

     public static void main(String args[]){
         PrintWriter out=new PrintWriter(System.out);
         InputReader in=new InputReader(System.in);
         TASK solver = new TASK();
         int t = in.nextInt();
//        int t=1;
         /*
          ** @author Jigar_Nainuji
          ** SVNIT-SURAT
          ** Jay Shree Ganesh
          */
         for(int i=0;i<t;i++)
         {
             solver.solve(in,out,i);
         }
         out.close();
     }
     static class TASK {
         static int mod = 998244353;
         void solve(InputReader in, PrintWriter out, int testNumber) {
         int n = in.nextInt();
         int x = in.nextInt();
         int y = in.nextInt();
         int d=y-x;
         int dd=1;
         for(int i=1;i<=d;i++)
         {
             if((d)%i==0)
             {
                 int yy = (d)/i -1;
                 if(n>=yy+2)
                 {
                     dd=i;
                     for(int j=x;j<=y;j+=dd)
                         System.out.print(j+" ");
                     n-=(yy+2);
                     while (n>0 && x-dd>0)
                     {
                         System.out.print((x-dd)+" ");
                         x-=dd;
                         n--;
                     }
                     while (n>0)
                     {
                         System.out.print((y+dd)+" ");
                         y+=dd;
                         n--;
                     }
                     System.out.println();
                     break;
                 }

             }
         }





         }
     }

     static class pair{
         int x;
         int y;
         pair(int x,int y)
         {
             this.x=x;
             this.y=y;
         }

     }
     static class Maths{
         static int gcd(int a, int b) {
             if (a == 0)
                 return b;
             return gcd(b % a, a);
         }



         public static long factorial(int n){
             long fact = 1;
             for(int i=1;i<=n;i++){
                 fact *= i;
             }
             return fact;
         }
     }


     static class InputReader {
         private InputStream stream;
         private byte[] buf = new byte[1024];
         private int curChar;
         private int numChars;
         private SpaceCharFilter filter;

         public InputReader(InputStream stream) {
             this.stream = stream;
         }

         public int read() {
             if (numChars == -1)
                 throw new InputMismatchException();

             if (curChar >= numChars) {
                 curChar = 0;
                 try {
                     numChars = stream.read(buf);
                 } catch (IOException e) {
                     throw new InputMismatchException();
                 }

                 if (numChars <= 0)
                     return -1;
             }
             return buf[curChar++];
         }

         public String nextLine() {
             BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
             String str = "";
             try {
                 str = br.readLine();
             } catch (IOException e) {
                 e.printStackTrace();
             }
             return str;
         }

         public int nextInt() {
             int c = read();

             while (isSpaceChar(c))
                 c = read();

             int sgn = 1;

             if (c == '-') {
                 sgn = -1;
                 c = read();
             }

             int res = 0;
             do {
                 if (c < '0' || c > '9')
                     throw new InputMismatchException();
                 res *= 10;
                 res += c - '0';
                 c = read();
             }
             while (!isSpaceChar(c));

             return res * sgn;
         }

         public long nextLong() {
             int c = read();
             while (isSpaceChar(c))
                 c = read();
             int sgn = 1;
             if (c == '-') {
                 sgn = -1;
                 c = read();
             }
             long res = 0;

             do {
                 if (c < '0' || c > '9')
                     throw new InputMismatchException();
                 res *= 10;
                 res += c - '0';
                 c = read();
             }
             while (!isSpaceChar(c));
             return res * sgn;
         }

         public double nextDouble() {
             int c = read();
             while (isSpaceChar(c))
                 c = read();
             int sgn = 1;
             if (c == '-') {
                 sgn = -1;
                 c = read();
             }
             double res = 0;
             while (!isSpaceChar(c) && c != '.') {
                 if (c == 'e' || c == 'E')
                     return res * Math.pow(10, nextInt());
                 if (c < '0' || c > '9')
                     throw new InputMismatchException();
                 res *= 10;
                 res += c - '0';
                 c = read();
             }
             if (c == '.') {
                 c = read();
                 double m = 1;
                 while (!isSpaceChar(c)) {
                     if (c == 'e' || c == 'E')
                         return res * Math.pow(10, nextInt());
                     if (c < '0' || c > '9')
                         throw new InputMismatchException();
                     m /= 10;
                     res += (c - '0') * m;
                     c = read();
                 }
             }
             return res * sgn;
         }

         public String readString() {
             int c = read();
             while (isSpaceChar(c))
                 c = read();
             StringBuilder res = new StringBuilder();
             do {
                 res.appendCodePoint(c);
                 c = read();
             }
             while (!isSpaceChar(c));

             return res.toString();
         }

         public boolean isSpaceChar(int c) {
             if (filter != null)
                 return filter.isSpaceChar(c);
             return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
         }

         public String next() {
             return readString();
         }

         public interface SpaceCharFilter {
             public boolean isSpaceChar(int ch);
         }
     }
 }