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.util.*;
  import java.io.*;
  public class Consecutive {
  
  	public static void main(String[] args) {
  		Consecutive.Kattio io = new Consecutive.Kattio();
  		int n = io.nextInt();
  		for(int i = 0; i < n; i++)
  		{
  			int num = io.nextInt();
  			for(int j = 0; j < num; j++)
  			{
  				io.print((j + 2) + " ");
  			}
  			io.println();
  		}
  		io.close();
  
  	}
  	
  	static class Kattio extends PrintWriter {
  		private BufferedReader r;
  		private StringTokenizer st;
  
  		public Kattio() {
  			this(System.in, System.out);
  		}
  
  		public Kattio(InputStream i, OutputStream o) {
  			super(o);
  			r = new BufferedReader(new InputStreamReader(i));
  		}
  
  		public Kattio(String problemName) throws IOException {
  			super(new FileWriter(problemName + ".out"));
  			r = new BufferedReader(new FileReader(problemName + ".in"));
  		}
  
  		public String next() {
  			try {
  				while (st == null || !st.hasMoreTokens())
  					st = new StringTokenizer(r.readLine());
  				return st.nextToken();
  			} catch (Exception e) {
  			}
  			return null;
  		}
  
  		public int nextInt() {
  			return Integer.parseInt(next());
  		}
  
  		public double nextDouble() {
  			return Double.parseDouble(next());
  		}
  
  		public long nextLong() {
  			return Long.parseLong(next());
  		}
  	}
  }
  