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.*;
  import java.util.*;
  
  public class AMain {
  
  	public static void main(String[] args) {
  		QuickReader in = new QuickReader(System.in);
  		
  		try(PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));)
  		{
  			new AMain().solve(in, out);
  		}
  	}
  	
  	public void solve(QuickReader in, PrintWriter out)
  	{
  		int T = in.nextInt();
  		while(T-->0)
  		{
  			int n = in.nextInt();
  			for(int i=0;i<n;i++)
  			{
  				out.print(i+2);
  				if(i==n-1)
  					out.println();
  				else
  					out.print(' ');
  			}
  		}
  		
  		
  	}
  
  }
  
  class QuickReader
  {
  	BufferedReader in;
  	StringTokenizer token;
  	
  	public QuickReader(InputStream ins)
  	{
  		in=new BufferedReader(new InputStreamReader(ins));
  		token=new StringTokenizer("");
  	}
  
  	public boolean hasNext()
  	{
  		while (!token.hasMoreTokens())
  		{
  			try
  			{
  				String s = in.readLine();
  				if (s == null) return false;
  				token = new StringTokenizer(s);
  			} catch (IOException e)
  			{
  				throw new InputMismatchException();
  			}
  		}
  		return true;
  	}
  
  	public String next()
  	{
  		hasNext();
  		return token.nextToken();
  	}
  
  	public int nextInt()
  	{
  		return Integer.parseInt(next());
  	}
  
  	public int[] nextInts(int n)
  	{
  		int[] res = new int[n];
  		for (int i = 0; i < n; i++)
  			res[i] = nextInt();
  		return res;
  	}
  
  	public long nextLong() {
  		return Long.parseLong(next());
  	}
  	
  	public long[] nextLongs(int n)
  	{
  		long[] res = new long[n];
  		for (int i = 0; i < n; i++)
  			res[i] = nextLong();
  		return res;
  	}
  	
  }
  
  