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.FileNotFoundException;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.StringTokenizer;
  
  public class TaskA {
  
      public static void main(String[] arg) throws FileNotFoundException {
          final FastScanner in = new FastScanner(System.in);
          final PrintWriter out = new PrintWriter(System.out);
          final int T = in.nextInt();
          for (int t = 1; t <= T; t++) {
              final int n = in.nextInt();
              StringBuilder result = new StringBuilder();
              for (int i = 2; i < n + 2; i++) {
                  result.append(i).append(' ');
              }
              out.println(result);
          }
          out.flush();
          out.close();
          in.close();
      }
  
  
      private static class FastScanner {
          BufferedReader br;
          StringTokenizer st;
  
          FastScanner(InputStream stream) {
              try {
                  br = new BufferedReader(new InputStreamReader(stream));
              } catch (Exception e) {
                  e.printStackTrace();
              }
          }
  
          String next() {
              while (st == null || !st.hasMoreTokens()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          int[] readIntArr(int n) {
              int[] result = new int[n];
              for (int i = 0; i < n; i++) {
                  result[i] = Integer.parseInt(next());
              }
              return result;
          }
  
          long[] readLongArr(int n) {
              long[] result = new long[n];
              for (int i = 0; i < n; i++) {
                  result[i] = Long.parseLong(next());
              }
              return result;
          }
  
          void close() {
              try {
                  br.close();
              } catch (IOException e) {
                  e.printStackTrace();
              }
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
  
      }
  
  }
  