description: Given n, find any array a_1, a_2, …, a_n of integers such that all of the following conditions hold: 
  
    * 1 ≤ a_i ≤ 10^9 for every i from 1 to n.
  
    * a_1 < a_2 < … <a_n
  
    * For every i from 2 to n, a_i isn't divisible by a_{i-1}
  
  
  
  
  It can be shown that such an array always exists under the constraints of the problem.
  
  Input
  
  The first line contains the number of test cases t (1 ≤ t ≤ 100). Description of the test cases follows.
  
  The only line of each test case contains a single integer n (1 ≤ n ≤ 1000).
  
  It is guaranteed that the sum of n over all test cases does not exceed 10^4.
  
  Output
  
  For each test case print n integers a_1, a_2, …, a_n — the array you found. If there are multiple arrays satisfying all the conditions, print any of them.
  
  Example
  
  Input
  
  
  3
  1
  2
  7
  
  
  Output
  
  
  1
  2 3
  111 1111 11111 111111 1111111 11111111 111111111
  
  Note
  
  In the first test case, array [1] satisfies all the conditions.
  
  In the second test case, array [2, 3] satisfies all the conditions, as 2<3 and 3 is not divisible by 2.
  
  In the third test case, array [111, 1111, 11111, 111111, 1111111, 11111111, 111111111] satisfies all the conditions, as it's increasing and a_i isn't divisible by a_{i-1} for any i from 2 to 7.
solution: import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.Arrays;
  import java.util.StringTokenizer;
  
  import static java.lang.Integer.parseInt;
  import static java.lang.Long.parseLong;
  import static java.lang.Double.parseDouble;
  import static java.lang.Math.max;
  import static java.lang.Math.min;
  import static java.lang.System.exit;
  
  public class Main {
  	
  	static final long INF = 1000000000l;
  
  	static void solve() throws Exception {
  		int n = nextInt();
  		for(int i = 0; i < n; i++) {
  			int val = nextInt();
  			int ct = 1;
  			for(int j = 2; j <= INF && val > 0; j++) {
  				if(isPrime(j)) {
  					out.print(j + " ");
  					val--;
  				}
  			}
  			out.println();
  		}
  	}
  	
  	static boolean isPrime(int n) {
  		assert(n > 0);
  		if(n == 0 || n == 1) return false;
  		for(int i = 2; i < n; i++) {
  			if(n % i == 0) return false;
  		}
  		return true;
  	}
  
  	static int nextInt() throws IOException {
  		return parseInt(next());
  	}
  
  	static long nextLong() throws IOException {
  		return parseLong(next());
  	}
  
  	static double nextDouble() throws IOException {
  		return parseDouble(next());
  	}
  
  	static String next() throws IOException {
  		while (tok == null || !tok.hasMoreTokens()) {
  			tok = new StringTokenizer(in.readLine());
  		}
  		return tok.nextToken();
  	}
  
  	static BufferedReader in;
  	static PrintWriter out;
  	static StringTokenizer tok;
  
  	public static void main(String[] args) {
  		try {
  			in = new BufferedReader(new InputStreamReader(System.in));
  			out = new PrintWriter(System.out);
  			solve();
  			in.close();
  			out.close();
  		} catch (Throwable e) {
  			e.printStackTrace();
  			exit(1);
  		}
  	}
  }