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.Math.*;
  import static java.lang.System.out;
  import java.util.*;
  import java.io.*;
  import java.math.*;
  
  // Solution
  
  public class G {
  
  
          public static void main(String[] args) {
  
              //~ BufferedReader br = new BufferedReader(new FileReader("input.txt"));
              //~ PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
              //~ FastInput sc = new FastInput();
              //~ sc.br = br;
  
              FastInput sc = new FastInput();
              int T = sc.nextInt();
              while(T-->0)
              {
                  int n = sc.nextInt();
  
  
                  for(int i = 2;i<=n+1;i++)
                      System.out.print(i+" ");
                  System.out.println();
  
              }
  
  	
  			
  			
          }
  
  
  
  
  }
  class FastInput {
  
          BufferedReader br;
          StringTokenizer st;
  
          public FastInput()
          {
              br = new BufferedReader(new InputStreamReader(System.in));
  
          }
          public String next() {
  
              while(st == null || !st.hasMoreElements())
              {
                  try {
  
                      st = new StringTokenizer(br.readLine());
  
                  } catch(IOException e)
                  {
                      System.out.println(e.toString());
                  }
              }
              return st.nextToken();
  
          }
          public int nextInt()
          {
              return Integer.parseInt(next());
          }
          public long nextLong()
          {
              return Long.parseLong(next());
          }
          public double nextDouble()
          {
              return Double.parseDouble(next());
          }
          public String nextLine()
          {
              String str = "";
  
              try {
                  str = br.readLine();
              } catch(IOException e)
              {
                  System.out.println(e.toString());
              }
              return str;
          }
          public static void sort(int[] arr)
          {
              ArrayList<Integer> ls = new ArrayList<Integer>();
              for(int x: arr)
                  ls.add(x);
              Collections.sort(ls);
              for(int i=0; i < arr.length; i++)
                  arr[i] = ls.get(i);
          }
          public  int [] readArr(int n)
          {
              int [] a = new int[n];
              for(int i = 0; i<n; i++)
                  a[i] = nextInt();
              return a;
          }
  }
  
  