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.BufferedReader;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.InputStreamReader;
  import java.io.OutputStream;
  import java.io.PrintWriter;
  import java.math.BigDecimal;
  import java.util.*;
  import java.util.concurrent.CompletableFuture;
  
  import static java.util.Arrays.binarySearch;
  import static java.util.Arrays.copyOfRange;
  import static java.util.Arrays.fill;
  
  public class Main {
  
      public static void main(String[] args) throws Exception {
          InputStream inputStream = System.in;
          OutputStream outputStream = System.out;
  
          InputReader in = new InputReader(inputStream);
          PrintWriter out = new PrintWriter(outputStream);
  
          Task solver = new Task();
          solver.solve(in, out);
          out.close();
      }
  }
  
  class Task {
  
      int mod = 998244353;
  
      public void solve(InputReader in, PrintWriter out) throws Exception {
          int T = in.nextInt();
  
          int[] p = new int[1000];
          int c = 0;
          for (int i = 2; c < 1000; i++) {
              boolean ok = true;
              for (int j = 2; j * j <= i; j++) {
                  if (i % j == 0) {
                      ok = false;
                      break;
                  }
              }
              if (ok) {
                  p[c++] = i;
              }
          }
  
          for (int tc = 1; tc <= T; tc++) {
              int n = in.nextInt();
              for (int i = 0; i < n; i++) {
                  out.print(p[i] + " ");
              }
              out.println();
          }
  
      }
  
  }
  
  class InputReader {
  
      private final BufferedReader reader;
      private StringTokenizer tokenizer;
  
      public InputReader(InputStream stream) {
          reader = new BufferedReader(new InputStreamReader(stream));
          tokenizer = null;
      }
  
      public String nextLine() {
          try {
              return reader.readLine();
          } catch (IOException e) {
              throw new RuntimeException(e);
          }
      }
  
      public String next() {
          while (tokenizer == null || !tokenizer.hasMoreTokens()) {
              tokenizer = new StringTokenizer(nextLine());
          }
          return tokenizer.nextToken();
      }
  
      public int nextInt() {
          return Integer.parseInt(next());
      }
  
      public long nextLong() {
          return Long.parseLong(next());
      }
  
      public double nextDouble() {
          return Double.parseDouble(next());
      }
  
  }