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:   /* package codechef; // don't place package name! */
  import java.util.*;
  import java.lang.*;
  import java.io.*;
  import java.math.BigInteger;
   
   
   
   
   
  public class hello{
   
     static class Pair implements Comparable<Pair>{
   
      long val;
      long ind;
      public Pair(long val,long ind)
      {
          this.val=val;
          this.ind=ind;
      }
   
      public int compareTo(Pair o)
      {
          return Long.compare(this.val, o.val);
  }
  }
       static class FastReader 
      { 
          BufferedReader br; 
          StringTokenizer st; 
    
          public FastReader() 
          { 
              try {
                 br=new BufferedReader(new FileReader("input.txt"));
                 PrintStream out= new PrintStream(new FileOutputStream("output.txt"));
                 System.setOut(out);
              }
    
              // Catch block to handle the exceptions
              catch (Exception e) {
                  br=new BufferedReader(new InputStreamReader(System.in));
              }
          } 
    
          String next() 
          { 
              while (st == null || !st.hasMoreElements()) 
              { 
                  try
                  { 
                      st = new StringTokenizer(br.readLine()); 
                  } 
                  catch (IOException  e) 
                  { 
                      e.printStackTrace(); 
                  } 
              } 
              return st.nextToken(); 
          } 
    
          int nextInt() 
          { 
              return Integer.parseInt(next()); 
          } 
    
          long nextLong() 
          { 
              return Long.parseLong(next()); 
          } 
    
          double nextDouble() 
          { 
              return Double.parseDouble(next()); 
          } 
    
          String nextLine() 
          { 
              String str = ""; 
              try
              { 
                  str = br.readLine(); 
              } 
              catch (IOException e) 
              { 
                  e.printStackTrace(); 
              } 
              return str; 
          } 
      } 
       static int computeXOR(int n)
      {
          // If n is a multiple of 4
          if (n % 4 == 0)
              return n;
        
          // If n%4 gives remainder 1
          if (n % 4 == 1)
              return 1;
        
          // If n%4 gives remainder 2
          if (n % 4 == 2)
              return n + 1;
        
          // If n%4 gives remainder 3
          return 0;
      }
      public static void main (String[] args) throws java.lang.Exception
      {
   
         try{
          FastReader sc=new FastReader();
          BufferedWriter out = new BufferedWriter(
              new OutputStreamWriter(System.out));
          int t = sc.nextInt();
          while(t-->0)
          {
              int n = sc.nextInt();
              int arr[] = new int[n];
              arr[0] = 2;
              for(int i=1;i<n;i++)
              {
                  arr[i] = 2*(i+1)+1;
              }
  
              for(int i=0;i<n;i++)
                  System.out.print(arr[i]+" ");
              System.out.println();
          }
      }catch(Exception e){
              return;
          }
      }
  }