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.io.OutputStream;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.PrintWriter;
  import java.util.List;
  import java.util.Arrays;
  import java.util.Scanner;
  import java.util.ArrayList;
  
  /**
   * Built using CHelper plug-in
   * Actual solution is at the top
   */
  public class Main {
      public static void main(String[] args) {
          InputStream inputStream = System.in;
          OutputStream outputStream = System.out;
          Scanner in = new Scanner(inputStream);
          PrintWriter out = new PrintWriter(outputStream);
          TaskA solver = new TaskA();
          solver.solve(1, in, out);
          out.close();
      }
  
      static class TaskA {
          static List<Integer> list = L.getPrimes(10000);
  
          public void solve(int testNumber, Scanner in, PrintWriter out) {
              int T = in.nextInt();
              while (T-- > 0) {
                  solveOne(in, out);
              }
          }
  
          private void solveOne(Scanner in, PrintWriter out) {
              int N = in.nextInt();
              L.printArrayList(list.subList(1, N + 1), out);
          }
  
      }
  
      static class L {
          public static void printArrayList(List<Integer> l, PrintWriter out) {
              StringBuilder sb = new StringBuilder();
              for (int num : l) {
                  sb.append(num).append(" ");
              }
              out.println(sb.toString().trim());
          }
  
          public static List<Integer> getPrimes(int upTo) {
              boolean[] primes = new boolean[upTo];
              Arrays.fill(primes, true);
              int prime = 2;
              int sqrt = (int) Math.ceil(Math.sqrt(upTo));
              while (prime < sqrt) {
                  for (int j = prime * prime; j < primes.length; j += prime) {
                      primes[j] = false;
                  }
                  for (int z = prime + 1; z < primes.length; z++) {
                      if (primes[z]) {
                          prime = z;
                          break;
                      }
                  }
              }
              List<Integer> list = new ArrayList<>();
              for (int i = 1; i < primes.length; i++) {
                  if (primes[i]) {
                      list.add(i);
                  }
              }
              return list;
          }
  
      }
  }
  
  