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.*;
  import java.math.*;
  
  public class Solutiona {
      public static void main(String arg[]) throws IOException {
          CustomInputReader sc = new CustomInputReader();
          PrintWriter pw = new PrintWriter(System.out);
          
          List<Integer> primes = new ArrayList<>();
          int max = 1000005;
          boolean isPrime[] = new boolean[max];
          Arrays.fill(isPrime, true);
          isPrime[1] = false;
  
          for(int i=2;i<max;++i) {
              if(isPrime[i]) {
                  primes.add(i);
                  for(int j=i*2;j<max;j+=i) {
                      isPrime[j] = false;
                  }
              }
          }
  
          int tc = sc.nextInt();
          while(tc -->0) {
              int n = sc.nextInt();
              for(int i=0;i<n;++i) pw.print(primes.get(i) + " ");
              pw.println("");
          }
  
  
          //flush output
          pw.flush();
          pw.close();
      }
  
      static class CustomInputReader {
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  
          public int nextInt() throws IOException {
              return Integer.parseInt(br.readLine());
          }
  
          public int[] nextIntArr(int n) throws IOException {
              String in[] = br.readLine().split(" ");
              int arr[] = new int[n];
              for(int i=0;i<n;++i) arr[i]=Integer.parseInt(in[i]);
              return arr;
          }
  
          public long nextLong() throws IOException {
              return Long.parseLong(br.readLine());
          }
  
          public long[] nextLongArr(int n) throws IOException {
              String in[] = br.readLine().split(" ");
              long arr[] = new long[n];
              for(int i=0;i<n;++i) arr[i]=Long.parseLong(in[i]);
              return arr;
          }
  
          public String next() throws IOException {
              return br.readLine();
          }
      }
          
  }
  
      