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.IOException;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;
import java.io.*;
import java.util.Locale;

public class C {
	public static void main(String[] args) throws IOException {
		Reader r = new Reader();
		Writer w = new Writer();

		int t = r.nextInt();
		for (int i = 0; i < t; ++i) {
			int n = r.nextInt();
			int x = r.nextInt();
			int y = r.nextInt();

			int a = y - x;
			int min_k = Integer.MAX_VALUE;
			int min_d = 0;
			for (int j = 1; j <= a; ++j) {
				if (a % j != 0)
					continue;
				if (a / j > n - 1)
					continue;
				int k;
				for (k = x; k + j * (n - 1) >= y && k > 0; k -= j)
					;
				k += j;
				if (k + j * (n - 1) < min_k) {
					min_k = k;
					min_d = j;
				}
			}
			for (int j = 0; j < n; ++j)
				w.print((min_k + j * min_d) + " ");
			w.println("");
		}

		w.close();
	}
}


/**
 * Custom class used for fast output.
 */
class Writer {
    private final BufferedWriter bw;

    public Writer() {
        this.bw = new BufferedWriter(new OutputStreamWriter(System.out));
    }

    public void print(Object object) throws IOException {
        bw.append("" + object);
    }

    public void printf(String format, Object... objects) throws IOException {
        bw.append(String.format(Locale.US, format, objects));
    }

    public void println(Object object) throws IOException {
        print(object);
        bw.append("\n");
    }

    public void close() throws IOException {
        bw.close();
    }

}


/**
 * Custom class for fast input that uses BufferedReader and StringTokenizer.
 */
class Reader {
	private BufferedReader br;
	private StringTokenizer st;

	public Reader() {
		br = new BufferedReader(new InputStreamReader(System.in));
	}

	private String next() throws IOException {
		while (st == null || !st.hasMoreElements())
			st = new StringTokenizer(br.readLine());
		return st.nextToken();
	}

	public int nextInt() throws IOException {
		return Integer.parseInt(next());
	}

	public int[] nextIntArray(int size) throws IOException {
		int[] arr = new int[size];
		for (int i = 0; i < size; ++i)
			arr[i] = nextInt();
		return arr;
	}

	public int[][] nextIntMatrix(int rows, int cols) throws IOException {
		int[][] matrix = new int[rows][cols];
		for (int i = 0; i < rows; ++i)
			for (int j = 0; j < cols; ++j)
				matrix[i][j] = nextInt();
		return matrix;
	}

	public double[][] nextdoubleMatrix(int rows, int cols) throws IOException {
		double[][] matrix = new double[rows][cols];
		for (int i = 0; i < rows; ++i)
			for (int j = 0; j < cols; ++j)
				matrix[i][j] = nextDouble();
		return matrix;
	}

	public Double[][] nextDoubleMatrix(int rows, int cols) throws IOException {
		Double[][] matrix = new Double[rows][cols];
		for (int i = 0; i < rows; ++i)
			for (int j = 0; j < cols; ++j)
				matrix[i][j] = nextDouble();
		return matrix;
	}

	public ArrayList<Integer> nextIntArrayList(int size) throws IOException {
		ArrayList<Integer> lst = new ArrayList<>(size);
		for (int i = 0; i < size; ++i)
			lst.add(nextInt());
		return lst;
	}

	public long nextLong() throws IOException {
		return Long.parseLong(next());
	}

	public long[] nextLongArray(int size) throws IOException {
		long[] arr = new long[size];
		for (int i = 0; i < size; ++i)
			arr[i] = nextLong();
		return arr;
	}

	public ArrayList<Long> nextLongArrayList(int size) throws IOException {
		ArrayList<Long> lst = new ArrayList<>(size);
		for (int i = 0; i < size; ++i)
			lst.add(nextLong());
		return lst;
	}

	public double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}

	public double[] nextDoubleArray(int size) throws IOException {
		double[] arr = new double[size];
		for (int i = 0; i < size; ++i)
			arr[i] = nextDouble();
		return arr;
	}

	public String nextString() throws IOException {
		return next();
	}

	public String[] nextStringArray(int size) throws IOException {
		String[] arr = new String[size];
		for (int i = 0; i < size; ++i)
			arr[i] = nextString();
		return arr;
	}

	public ArrayList<String> nextStringArrayList(int size) throws IOException {
		ArrayList<String> lst = new ArrayList<>(size);
		for (int i = 0; i < size; ++i)
			lst.add(nextString());
		return lst;
	}

	public String nextLine() throws IOException {
		return br.readLine();
	}
}