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.math.BigInteger;
	import java.sql.Array;
	import java.util.ArrayList;
		import java.util.Arrays;
		import java.util.Collection;
		import java.util.Collections;
		import java.util.Comparator;
		import java.util.HashMap;
		import java.util.InputMismatchException;
		import java.util.Iterator;
		import java.util.LinkedHashSet;
		import java.util.LinkedList;
		import java.util.List;
		import java.util.Map;
		import java.util.Map.Entry;
		import java.util.PriorityQueue;
		import java.util.Queue;
		import java.util.Scanner;
		import java.util.Set;
		import java.util.Stack;
		import java.io.BufferedReader;
		import java.io.IOException;
		import java.io.InputStream;
		import java.io.InputStreamReader;
		import java.util.Scanner;
		import java.util.StringTokenizer;
		import java.util.TreeMap;
		import java.util.TreeSet;
		
		public class Main {
											
		//	static FastReader sc= new FastReader();
		static ArrayList<Integer> C;
		static ArrayList<Integer> B;
		static	int mod=(int)1e9+9;
		static long dp[];
		static int k;
		
		static StringBuilder as=new StringBuilder();
		static InputReader rd=new InputReader(System.in);
		
		static int count=0;
	
		public static void main(String[] args) {
			//HashMap<Long,Long>map =new HashMap<Long, Long>();
					
				//code
			    
			int t=rd.readInt();
			
			while(t-->0) {
				
				int n=rd.readInt();
				int x=rd.readInt();
				int y=rd.readInt();
				int ans=Integer.MAX_VALUE;
				
				for(int i=1;i<=50;i++) {
					if((y-x)%i!=0)continue;
					int k=0;
					int j=x;
					
					while(j<y) {
						j+=i;
						k++;
					}

					
					
					
					
					if(k<n&&ans>i)ans=i;
					
					
					
					
					
					
				}
				int k=0;
				int j=x;
				k++;
				System.out.print(y+" ");
			//	System.out.print(x+" ");
				k++;
				System.out.print(x+" ");
				j=x;
				while(j<y&&k<n) {
					
					j+=ans;
					
					if(j!=y) {
					System.out.print(j+" ");k++;}
				}
				j=x;
				while(k<n&&j>0) {

					j-=ans;
			
					if(j>0) {
					System.out.print(j+" ");
					k++;
					}}
				j=y;
				while(k<n) {
					
					j+=ans;
					k++;
					System.out.print(j+" ");
				}
				
				System.out.println();
				
			}
			
		}
		
		
			static void DFS(ArrayList<ArrayList<Integer>> adj,int s,boolean[] visited) {
				
				
				
				count++;
			//	System.out.println(count);
				visited[s]=true;
				
				for(int i:adj.get(s)) {
					
					if(!visited[i])DFS(adj, i, visited);
				}
				
				
				
			}
	
		
			void BFS(int s,int n) {
				
				
				boolean visited[]= new boolean[n];
				
				LinkedList<Integer> q=new LinkedList<>();
				
				
				
				
			}
				    
				    
				    
				    
				
		
		
		
		static int MSB(int z) {
			for (int i=20; i>=0; i--) {
				if (((z>>i)&1)!=0) return i;
			}
			return -1;
		}
	
		
		static long ans=(long)1e18;
		static void dfs(int s,ArrayList<ArrayList<Integer>> adj,boolean []visited) {
			
			
			visited[s]=true;
			
			
			for(int i:adj.get(s)) {
				
				if(!visited[i])dfs(i, adj, visited);
			}
			
			
			
			
		}
		
		static boolean isPowerOfTwo (int x) 
		{ 
		  /* First x in the below expression is  
		    for the case when x is 0 */
		    return x!=0 && ((x&(x-1)) == 0); 
		      
		} 
		
				
				//extended Euclidean Algorithm 
				public static int gcd(int a, int b) 
				{ 
				    if (a == 0) 
				        return b; 
				      
				    return gcd(b%a, a); 
				} 
		
		
		static boolean isPrime(int n) { 
		    //check if n is a multiple of 2 
		    if (n%2==0) return false; 
		    //if not, then just check the odds 
		    for(int i=3;i<=Math.sqrt(n);i+=2) { 
		        if(n%i==0) 
		            return false; 
		    } 
		    return true; 
		} 
					static long solve(long n) {
						long sum=(n*(n+1)/2);
						long l=sum/2;
						if(n==3) {
							return 2;
						}
						long k=n;
						if(sum%2==0) {
							long j=n;
							int c=1;
							boolean flag=false;
							long s=0;
							while(j<l) {
								
								n--;
								c++;
								j+=n;
								
								if(j==l) {flag =true;s=n-1;}
								
							}
							long point =l-(j-k);
							long e=0;
							
							if(flag) {
								e=s*(s-1)/2+(k-s)*(k-s-1)/2;
								
							}
							
						//System.out.println(e+" "+c);
							return (c+e);
						}
						else return 0;
						
						
						
					
						
					}
			
			
			static class solver{
				int d;
				double w;
				public solver(int d,double w) {
					
				this.d=d;
				this.w=w;
				
					
				}
				
				
			}
			
			
			
			
			
			
			  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 int readInt() {
			            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 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);
			    }	
			
			
			static int c=0;
		static    void DFSUtil(int s,ArrayList<ArrayList<solver>> adj,int V,boolean visited[],double pw) {
		    	
			
		    	visited[s]=true;
		    	c++;
		    	
		  // 	System.out.print(c+" ");
		
		for(solver i:adj.get(s)) {
			
		
		if(pw>i.w) {
			//System.out.println(pw+" "+i.w+" "+(pw>i.w));
		    		continue;}
		    		
		    		if(!visited[i.d]) {
		    			
		    			DFSUtil(i.d,adj,V,visited,i.w);
		    		}
		    		
		    	}
		    	
		    }
		    
			
			public static <T> ArrayList<T> removeDuplicates(ArrayList<T> list) 
		    { 
		  
		        // Create a new LinkedHashSet 
		        Set<T> set = new LinkedHashSet<>(); 
		  
		        // Add the elements to set 
		        set.addAll(list); 
		  
		        // Clear the list 
		        list.clear(); 
		  
		        // add the elements of set 
		// with no duplicates to the list 
		        list.addAll(set); 
		  
		        // return the list 
				        return list; 
				    } 
		static		class Ungraph{
					
					
					int V,E;
					
					Edge edge[];
					
					class Edge{
						int src,dest;
						
					};
					
						public Ungraph(int v,int e) {
							// TODO Auto-generated constructor stub
		
		V=v;
		
		E=e;
		edge=new Edge[e];
		
		for(int i=0;i<e;i++) {
			edge[i]=new Edge();
			
		}
		
		
		}
		
		class subset{
			
			int parent;
			int rank;
			
		}
		
		int find(subset subsets[],int i) {
			
			if(subsets[i].parent!=i) {
				subsets[i].parent=find(subsets,subsets[i].parent);
			}
			return subsets[i].parent;
		}
		
		
		//finding union
													void Union(subset subsets[],int x,int y) {
														int xroot=find(subsets,x);
														int yroot=find(subsets,y);
														
														if(subsets[xroot].rank<subsets[yroot].rank)subsets[xroot].parent=yroot;
														if(subsets[xroot].rank<subsets[yroot].rank)subsets[yroot].parent=xroot;
														 else
														    { 
														        subsets[xroot].parent = yroot; 
														        subsets[yroot].rank++; 
														    } 
													}
													
													
													  
													
													
													int isCycle(Ungraph graph) {
														
														subset subsets[]=new subset [graph.V];
														
															for(int i=0;i<graph.V;i++) { 	
																 subsets[i] = new subset(); 
																 subsets[i].parent=i;
																 subsets[i].rank=0;
																
															}
															for(int i=0;i<graph.E;i++) {
																int x=find(subsets,graph.edge[i].src);
																int y=find(subsets,graph.edge[i].dest);
																if(x==y)return 1;
																graph.Union(subsets, x, y);
															}
														
														return 0;
														
														
													}
													
												
												
											}
												
												
												
											
												
												
												
												
												
												
												
												
												
									
		}