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.*;
  import java.util.*;
  
  public class Main {
      public static void main(String[] args) throws IOException {
          SolveQue solveQue = new SolveQue();
          solveQue.ques();
      }
  }
  
  class SolveQue {
      static class FastScanner {
          BufferedReader br;
          StringTokenizer st;
  
          public FastScanner() {
              br = new BufferedReader(
                      new InputStreamReader(System.in));
          }
  
          String next() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  }
                  catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          int nextInt() { return Integer.parseInt(next()); }
  
          long nextLong() { return Long.parseLong(next()); }
  
          double nextDouble()
          {
              return Double.parseDouble(next());
          }
  
          String nextLine()
          {
              String str = "";
              try {
                  str = br.readLine();
              }
              catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
      private static final FastScanner fs = new FastScanner();
      private static final Scanner sc = new Scanner(System.in);
      private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
      private static final long MOD = (long) (1e9 + 7);
      private static PrintWriter out = new PrintWriter(System.out);
      private static BufferedWriter output = new BufferedWriter(new OutputStreamWriter(System.out));
      private static final int iInf = (int)(1e8);
      private static final long lInf = (long)(1e17);
  
      /** Optimal(Maximum,Minimum) Answers
       * 1. Binary search
       * 2. Prefix Suffix
       * 3. Greedy (sorting searching)
       * 4. DP
       * 5. Meet in the middle
       * 6. Fenwick Tree
       * 7. Segment Tree
       **/
      void solve(int T) throws IOException {
          int n = fs.nextInt();
          if (n <= 2) {
              if (n == 1) System.out.println(1);
              else System.out.println("11" + " 111");
              return;
          }
          StringBuilder ans = new StringBuilder();
          for (int i = 2; i <= n+1; i++) {
              ans.append(i).append(" ");
          }
          System.out.println(ans);
      }
      void ques() throws IOException {
          int t = 1;
  //        t = sc.nextInt();
          t = fs.nextInt();
  //        t = Integer.parseInt(br.readLine());
          int tt = 1;
          while (t-- > 0) {
              solve(tt);
              tt++;
          }
          System.gc();
      }
  }