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.math.*;
  import java.net.Inet4Address;
  import  java.util.*;
  public class sampleEditor_codeforces {
      static   int  mod=1000000007;
      static  int mod2=1000003;
      static  Scanner sc = new Scanner(System.in);
  
      static class Pair implements Comparable<Pair>{
          int x;
          int y;
  
          public Pair(int px , int py){
              x = px;
              y = py;
          }
  
          @Override
          public int compareTo(Pair pair){
              if (x > pair.x)
                  return 1;
              else if (x == pair.x)
                  return 0;
              else
                  return -1;
          }
  
      }
  
  
      public static void loop(int [] a,int l,int r){
          for(int i=l;i<r;i++){
              a[i]=sc.nextInt();
          }
      }
      public static long binaryToDecimal(String binary){
          int n=binary.length();
          int i=n-1;
          long sum=0;
          long two=1;
          while(i>=0){
              sum+=two*(binary.charAt(i)-'0')%mod2;
              two*=2;
              i--;
          }
          return sum;
      }
  
  
      public static boolean isSorted(int[] arr) {
          int n = arr.length;
          for (int i = 0; i < n - 1; i++) {
              if (arr[i] > arr[i + 1]) {
                  return false;
              }
          }
  
          return true;
      }
  
      public static void reverse(int[] arr) {
          int l = 0;
          int r = arr.length - 1;
          while (l < r) {
              int temp = arr[l];
              arr[l] = arr[r];
              arr[r] = temp;
              l++;
              r--;
          }
      }
  
      public static void reverse(int[] arr,int l,int r) {
  
          while (l < r) {
              int temp = arr[l];
              arr[l] = arr[r];
              arr[r] = temp;
              l++;
              r--;
          }
      }
      public  static  boolean isPalindrome(int n,int [] a,int x1){
          int [] b=new int[n];
          int m=0;
          for(int i=0;i<n;i++){
              if(a[i]!=x1){
                  b[m++]=a[i];
              }
          }
          for(int i=0;i<m;i++){
              if(b[i]!=b[m-1-i]){
                  return false;
              }
          }
          return true;
  
  
      }
  
      public static void solve(int n,int [] a) {
  
       a[0]=3;
       StringBuilder sb=new StringBuilder("");
       sb.append(3+" ");
       for(int i=1;i<n;i++) {
           a[i]=a[i-1]+2;
           sb.append(a[i]+" ");
       }
       sb.append("\n");
          System.out.print(sb);
  
      }
  
  
      public static void main(String args[]) {
  //        Scanner sc = new Scanner(System.in);
          int smallestNum=10000;
          int t = sc.nextInt();
          while (t-- > 0) {
             int n=sc.nextInt();
             int [] a=new int[n];
              solve(n,a);
          }
      }
  
  
  }