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 static java.lang.Integer.parseInt;
  import static java.lang.Long.parseLong;
  import static java.lang.Double.parseDouble;
  import static java.lang.Math.PI;
  import static java.lang.Math.min;
  import static java.lang.System.arraycopy;
  import static java.lang.System.exit;
  import static java.util.Arrays.copyOf;
  
  import java.util.LinkedList;
  import java.util.List;
  import java.util.Iterator;
  import java.io.FileReader;
  import java.io.FileWriter;
  import java.math.BigInteger; 
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.HashSet;
  import java.util.Set;
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.HashMap;
  import java.util.Map;
  
  import java.util.NoSuchElementException;
  import java.util.PriorityQueue;
  import java.util.Queue;
  import java.util.Stack;
  import java.util.StringTokenizer;
  import java.util.Comparator;
  import java.lang.StringBuilder;
  import java.util.Collections;
  import java.util.*;
  import java.text.DecimalFormat;
  public class Solution {
  	
  	static BufferedReader in;
  	static PrintWriter out;
  	static StringTokenizer tok;
  	static int mod= (int)1e9+1;
  	static boolean isPrime[];
  	
  	private static void solve() throws IOException{	
  		int n = scanInt();
  		for(int i = 1; i<=n; ++i){
  			out.print((i+1)+" ");
  		}
  		out.println();
  	}
  
  	public static void main(String[] args) {
  		try {
  			long startTime = System.currentTimeMillis();
  
  			in = new BufferedReader(new InputStreamReader(System.in));
  			out = new PrintWriter(System.out);
  			//in = new BufferedReader(new FileReader("input.txt"));
  			//out = new PrintWriter(new FileWriter("output.txt"));
  			int test=scanInt();
  			for(int t=1; t<=test; t++){
  				// out.print("Case #"+t+": ");
  				solve();
  			}
  			
  			long endTime   = System.currentTimeMillis();
  			long totalTime = endTime - startTime;
  			//out.println(totalTime+"  "+System.currentTimeMillis() );
  			in.close();
  			out.close();
  			
  		} catch (Throwable e) {
  			e.printStackTrace();
  			exit(1);
  		}
  	}
  	static int scanInt() throws IOException {
  		return parseInt(scanString());
  	}
  
  	static long scanLong() throws IOException {
  		return parseLong(scanString());
  	}
  	static double scanDouble() throws IOException {
  		return parseDouble(scanString());
  	}
  
  	static String scanString() throws IOException {
  		if (tok == null || !tok.hasMoreTokens()) {
  			tok = new StringTokenizer(in.readLine());
  		}
  		return tok.nextToken();
  	}
  	static String scanLine() throws IOException {
  		return in.readLine();
  	}
  	
  	
  }
   
  
  