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.util.*;
  import java.io.*;
  
  public class A {
      static FastScanner fs = new FastScanner(System.in);
      static PrintWriter pw = new PrintWriter(System.out);
      static StringBuilder sb = new StringBuilder();
      static long mod = (long) 1e9 + 7;
  
      public static void main(String[] args) throws Exception {
          int n = fs.nextInt();
          for(int i = 0; i < n; i++) solve();
          pw.flush();
      }
      public static void solve() {
          int n = fs.nextInt();
          if(n == 1) {
              pw.print(1);
          } else {
              for(int i = 2; i <= n + 1; i++)
                  pw.print(i + " ");
          }
          pw.println();
      }
  
      public static int gcd(int a, int b) {
          return a == 0 ? b : gcd(b % a, a);
      }
  
      static class GeekInteger {
          public static void save_sort(int[] array) {
              shuffle(array);
              Arrays.sort(array);
          }
  
          public static int[] shuffle(int[] array) {
              int n = array.length;
              Random random = new Random();
              for (int i = 0, j; i < n; i++) {
                  j = i + random.nextInt(n - i);
                  int randomElement = array[j];
                  array[j] = array[i];
                  array[i] = randomElement;
              }
              return array;
          }
  
          public static void save_sort(long[] array) {
              shuffle(array);
              Arrays.sort(array);
          }
  
          public static long[] shuffle(long[] array) {
              int n = array.length;
              Random random = new Random();
              for (int i = 0, j; i < n; i++) {
                  j = i + random.nextInt(n - i);
                  long randomElement = array[j];
                  array[j] = array[i];
                  array[i] = randomElement;
              }
              return array;
          }
  
      }
      static class FastScanner {
          private BufferedReader reader = null;
          private StringTokenizer tokenizer = null;
  
          public FastScanner(InputStream in) {
              reader = new BufferedReader(new InputStreamReader(in));
              tokenizer = null;
          }
  
          public FastScanner(FileReader in) {
              reader = new BufferedReader(in);
              tokenizer = null;
          }
  
          public String next() {
              if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                  try {
                      tokenizer = new StringTokenizer(reader.readLine());
                  } catch (IOException e) {
                      throw new RuntimeException(e);
                  }
              }
              return tokenizer.nextToken();
          }
  
          public String nextLine() {
              if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                  try {
                      return reader.readLine();
                  } catch (IOException e) {
                      throw new RuntimeException(e);
                  }
              }
              return tokenizer.nextToken("\n");
          }
  
          public long nextLong() {
              return Long.parseLong(next());
          }
  
          public int nextInt() {
              return Integer.parseInt(next());
          }
  
          public double nextDouble() {
              return Double.parseDouble(next());
          }
  
          public String[] nextArray(int n) {
              String[] a = new String[n];
              for (int i = 0; i < n; i++)
                  a[i] = next();
              return a;
          }
  
          public int[] nextIntArray(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++)
                  a[i] = nextInt();
              return a;
          }
  
          public long[] nextLongArray(int n) {
              long[] a = new long[n];
              for (int i = 0; i < n; i++)
                  a[i] = nextLong();
              return a;
          }
      }
  }
  
  
  