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: /*
   * To change this license header, choose License Headers in Project Properties.
   * To change this template file, choose Tools | Templates
   * and open the template in the editor.
   */
  //package extra;
  import java.util.*;
  import java.io.*;
  import java.math.BigInteger;
  public class Main1 {
      static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
      static PrintWriter pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
      static StringTokenizer st;
      static long mod =(long) 1e9+7;
      static int[][] dp,matrix;
      static int cnt=0;
      static int time;
      static int ans = 1; // N-.max_x and max_y
      
     static boolean isPrime(int n)
      {
   
          // Check if number is less than
          // equal to 1
          if (n <= 1)
              return false;
   
          // Check if number is 2
          else if (n == 2)
              return true;
   
          // Check if n is a multiple of 2
          else if (n % 2 == 0)
              return false;
   
          // If not, then just check the odds
          for (int i = 3; i <= Math.sqrt(n); i += 2)
          {
              if (n % i == 0)
                  return false;
          }
          return true;
      }
      public static void main(String[] args) throws IOException {
          ArrayList<Integer> arr = new ArrayList();
          for (int i = 2; i <=7919; i++) {
              if (isPrime(i)) {
                  arr.add(i);
              }
          }
         int t = readInt();
          for (int i = 0; i < t; i++) {
              int n = readInt();
              for (int j = 0; j < n; j++) {
                  System.out.print(arr.get(j)+" ");
              }
              System.out.println("");
          }
      }
      static class sort1 implements Comparator<pair>{
  
          @Override
          public int compare(pair p1, pair p2) {
              if (p1.a==p2.a) {
                  return Integer.compare(p1.s, p2.s);
              }
             return Integer.compare(p1.a, p2.a);
          }
          
      }
       static class pair implements Comparable<pair>{
  
          int s,a,t;
  
          pair(int s, int a,int t) {
              this.s=s;this.a=a;this.t=t;
          }
  
          @Override
          public int compareTo(pair p1) {
              return Integer.compare(this.s, p1.s);
          }
          
       }
      
      
      static class node{
          int num,par;
          node(int num,int par){
              this.num=num;this.par=par;
          }
      }
      static String next() throws IOException {
          while (st == null || !st.hasMoreTokens()) {
              st = new StringTokenizer(br.readLine().trim());
          }
          return st.nextToken();
      }
  
      static long readLong() throws IOException {
          return Long.parseLong(next());
      }
  
      static int readInt() throws IOException {
          return Integer.parseInt(next());
      }
  
      static double readDouble() throws IOException {
          return Double.parseDouble(next());
      }
  
      static String readLine() throws IOException {
          return br.readLine().trim();
      }
  }