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.BufferedWriter;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.OutputStreamWriter;
  
  
  public class Main {
      public static void main(String[] args) throws IOException {
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
  
          int n = Integer.parseInt(br.readLine());
          StringBuilder sb = new StringBuilder();
  
          boolean[] eratos = new boolean[7919 + 1];
          eratos[0] = true;
          eratos[1] = true;
  
          for (int i = 2; i * i <= 7919; i++) {
              if (!eratos[i]) {
                  for (int j = i + i; j <= 7919; j += i) {
                      eratos[j] = true;
                  }
              }
          }
  
          while(n-- > 0) {
              int x = Integer.parseInt(br.readLine());
              if(x == 1) {
                  sb.append(1).append("\n");
                  continue;
              }
              for (int i = 0; x > 0; i++) {
                  boolean e = eratos[i];
                  if(!e) {
                      sb.append(i).append(" ");
                      x--;
                  }
              }
              sb.append("\n");
          }
          bw.write(sb.toString());
          bw.close();
          br.close();
      }
  }