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.Scanner;
  
  public class A_polycarp_3_e {
      public static void main(String[] args) {
          Scanner sc = new Scanner(System.in);
          int t = sc.nextInt();
          while (t-->0){
              int n = sc.nextInt();
              int ii = 1;
              int i = 0;
              if(n>1){
                  i++;
              }
              ii = n;
              for(i = 2;i<=n+1;i++) {
                  System.out.print(ii + " ");
                  ii += (1);
  
              }
              System.out.println();
  //            String a1 = sc.nextLine();
  //            //String[] aa  = a1.split(" ");
  //            String p1 = sc.nextLine();
  //            System.out.println(a1);
  //            System.out.println(p1);
              //String[] pp  = p1.split(" ");
  //            for(int j = 0;j<aa.length;j++){
  //                System.out.print(aa[j]+"a");
  //            }
  //            System.out.println();
  //            for(int j = 0;j<pp.length;j++){
  //                    System.out.print(pp[j]+"p");
  //            }
  //            System.out.println();
  //            for(int i = 0;i<aa.length;i++){
  //                for(int j = 0;j<pp.length;j++){
  //                    if(Objects.equals(aa[i], pp[j])){
  //                        System.out.println(pp[j]);
  //                        break;
  //                    }
  //                }
  //            }
  //            int i = 0;
  //            while(i<pp.length){
  //                if(pp[i]==aa[i])
  //            }
              //System.out.println(a1.equals(p1));
  //            int n = sc.nextInt();
  //            int[] arr = new int[n];
  //            for(int i = 0;i<n;i++){
  //                arr[i] = sc.nextInt();
  //            }
  //            int[] nums = new int[n];
  //            for(int i = 0;i<n;i++){
  //                nums[i] = arr[i];
  //            }
  //            Arrays.sort(nums);
  //            int x = nums[nums.length-1];
  //            int fir = -1;
  //            int lst = -1;
  //            for(int I: arr){
  //                System.out.print(I+"(");
  //            }
  //            System.out.println();
  //            for(int I: nums){
  //                System.out.print(I+"(");
  //            }
  //            System.out.println();
  //            for(int i = 0;i<n;i++){
  //                if(arr[i]==x){
  //                    fir = i;
  //                    break;
  //                }
  //            }
  //            for(int i = n-1;i>=0;i--){
  //                if(arr[i]==x){
  //                    lst = i;
  //                }
  //            }
  //            if(n/2>=(lst-fir)){
  //                int y = lst-fir;
  //                System.out.println(n/2-(y));
  //            }
  //            else{
  //                System.out.println(0);
  //            }
          }
      }
  }
  