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 code5{
  
      static final int M = 1000000007;
  
      // Fast input 
      static class Hrittik_FastReader{
          StringTokenizer st;
          BufferedReader br;
          public int n;
          public Hrittik_FastReader(){
              br=new BufferedReader(new InputStreamReader(System.in));
          }
          String next(){
              while(st==null || !st.hasMoreTokens()){
                  try {
                      st=new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
          String nextLine(){
              String str="";
              try {
                  str=br.readLine().trim();
              } catch (Exception e) {
                  e.printStackTrace();
              }
              return str;
          }
          double nextDouble(){
              return Double.parseDouble(next());
          }
          int nextInt(){
              return Integer.parseInt(next());
          }
          long nextLong(){
              return Long.parseLong(next());
          }
          
          
      }
      // Fast output
      static class Hrittik_FastWriter {
          private final BufferedWriter bw;
  
          public Hrittik_FastWriter() {
              this.bw = new BufferedWriter(new OutputStreamWriter(System.out));
          }
  
          public void println(Object object) throws IOException {
              print(object);
              bw.append("\n");
          }
  
          public void print(Object object) throws IOException {
              bw.append("" + object);
  
          }
  
          public void close() throws IOException {
              bw.close();
          }
      }
  
      /**
       * 
       * @param a
       * @param b
       * @return gcd of two numbers using recursion
       */
      private static int gcd(int a , int b){
          if(b == 0) return a;
          return gcd(b, a%b);
      }
  
  
      public static void main(String[] args) {
  
          try {
              Hrittik_FastReader Sc =new Hrittik_FastReader();
              Hrittik_FastWriter out = new Hrittik_FastWriter();
              int t = Sc.nextInt();
              while(t-- > 0){
                  // write your code here
                  int n = Sc.nextInt();
                  long a[] = new long[n];
                  a[0] = 2;
                  long j = 3;
                  for(int i = 1; i < n; i++){
                      a[i] = j;
                      j += 2;
                  }
                  for(long ele : a){
                      System.out.print(ele + " ");
                  }
                  System.out.println();
                 
  
                  
                  
                  
              }
              out.close();
          }
  
          catch (Exception e) {
              return;
          }
      }
  }
  