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 com.sun.security.jgss.GSSUtil;
  
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.math.BigInteger;
  import java.util.*;
  
  
  public class javacp{
  
  
      static FastReader fs=new FastReader();
      static class FastReader{
          BufferedReader br;
          StringTokenizer st;
          public FastReader(){
              br = new BufferedReader(new InputStreamReader(System.in));
          }
          String next(){
              while (st == null || !st.hasMoreElements()){
                  try{
                      st = new StringTokenizer(br.readLine());
                  }catch (IOException e){
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
          int nextInt(){
              return Integer.parseInt(next());
          }
          long nextLong(){
              return Long.parseLong(next());
          }
          double nextDouble(){
              return Double.parseDouble(next());
          }
          String nextLine(){
              String str = "";
              try{
                  str = br.readLine();
              }catch (IOException e){
                  e.printStackTrace();
              }
              return str;
          }
  
          int[] inputIntArray(int n){
              int[] arr = new int[n];
              for(int i=0;i<n;i++)
                  arr[i] = fs.nextInt();
  
              return arr;
          }
      }
  
      static void sort(int[] arr){
          ArrayList<Integer> al = new ArrayList<>();
          for(int val : arr){
              al.add(val);
          }
  
          Collections.sort(al);
          for(int i=0;i<arr.length;i++){
              arr[i] = al.get(i);
          }
      }
  
      static class Pair implements Comparable<Pair>{
          int src;
          int dest;
          long wt;
  
          Pair(int src,int dest,long wt){
              this.src = src;
              this.dest = dest;
              this.wt = wt;
          }
  
          public int compareTo(Pair pair){
              if(this.wt > pair.wt)
                  return 1;
              else if(this.wt < pair.wt)
                  return -1;
              else
                  return 0;
          }
      }
  
  
      static int[] par1 , rank1 , size;
      static int[] par2;
      static int[] rank2;
  
      static boolean union1(int vt1 , int vt2){
          int parent1 = findParent1(vt1) , parent2 = findParent1(vt2);
          int r1 = rank1[parent1] , r2 =  rank1[parent2];
  
          if(parent1 == parent2) return false;
  
          if(r1 < r2) {
              par1[parent1] = parent2;
              size[parent2] += size[parent1];
          }
          else{
              par1[parent2] = parent1;
              size[parent1] += size[parent2];
          }
  
          if(r1 == r2) rank1[parent1]++;
  
          return true;
      }
  
      static void union2(int vt1 , int vt2){
          int parent1 = findParent2(vt1) , parent2 = findParent2(vt2);
          int r1 = rank2[parent1] , r2 =  rank2[parent2];
  
          if(parent1 == parent2) return;
  
          if(r1 < r2)
              par2[parent1] = parent2;
          else par2[parent2] = parent1;
  
          if(r1 == r2) rank2[parent1]++;
      }
  
      static int findParent1(int vt){
          if(par1[vt] == vt) return vt;
          par1[vt] = findParent1(par1[vt]);
  
          return par1[vt];
      }
  
      static int findParent2(int vt){
          if(par2[vt] == vt) return vt;
          par2[vt] = findParent2(par2[vt]);
  
          return par2[vt];
      }
  
      static void initialise1(int numOfVtces){
          par1 = new int[numOfVtces];
          rank1 = new int[numOfVtces];
          size = new int[numOfVtces];
  
          for(int i=0;i<numOfVtces;i++){
              par1[i] = i;
              rank1[i] = 1;
              size[i] = 1;
          }
      }
  
      static void initialise2(int numOfVtces){
          par2 = new int[numOfVtces];
          rank2 = new int[numOfVtces];
  
          for(int i=0;i<numOfVtces;i++){
              par2[i] = i;
              rank2[i] = 0;
          }
      }
  
  
  
      public static void main(String[] args) throws IOException{
  
          int t = 1;
          t = fs.nextInt();
  
          while (t-- > 0) {
              int n = fs.nextInt();
              for(int i=1; i <= n; i++){
                  System.out.print((i+1)+" ");
              }
              System.out.println();
          }
      }
  
      private static String generateABPattern(int a , int b){
          StringBuilder sb = new StringBuilder();
          while (a > 0 || b > 0){
              if(b-a >= 2){
                  sb.append("bb");
                  if(a != 0){
                      sb.append("a");
                      a--;
                  }
                  b -= 2;
              }
              else if(a-b >= 2){
                  sb.append("aa");
                  if(b != 0){
                      sb.append("b");
                      b--;
                  }
                  a -= 2;
              }
              else if(a >= b){
                  sb.append("a");
                  a--;
              }
              else{
                  sb.append("b");
                  b--;
              }
          }
  
          return sb.toString();
      }
      private static int binarySearch(int[] arr , int i , int  j , int val){
          while (i <= j){
              int mid = (i+j)/2;
              if(arr[mid] == val) return mid;
              else if(arr[mid] > val) j = mid-1;
              else i = mid+1;
          }
          return -1;
      }
  
      private static int lower_bound(int[] arr , int i, int j, int val){
          int min = -1;
          while (i <= j){
              int mid = (i+j)/2;
              if(arr[mid] > val) j = mid-1;
              else{
                  min = mid;
                  i = mid+1;
              }
          }
          return min;
      }
  
      private static int upper_bound(int[] arr, int i , int j , int val){
          int min = -1;
          while (i <= j){
              int mid = (i+j)/2;
              if(arr[mid] < val) i = mid+1;
              else{
                  min = mid;
                  j = mid-1;
              }
          }
          return min;
      }
  
      static int modInverse(int a, int m)
      {
          int m0 = m;
          int y = 0, x = 1;
  
          if (m == 1)
              return 0;
  
          while (a > 1) {
              // q is quotient
              int q = a / m;
  
              int t = m;
  
              // m is remainder now, process
              // same as Euclid's algo
              m = a % m;
              a = t;
              t = y;
  
              // Update x and y
              y = x - q * y;
              x = t;
          }
  
          // Make x positive
          if (x < 0)
              x += m0;
  
          return x;
      }
  
      static int mod = 1000000007;
      static long  power(long a,long b,long m) {
          a %= m;
          long res = 1;
          while (b > 0) {
              if ((b & 1) == 1)
                  res = res * a % m;
              a = a * a % m;
              b >>= 1;
          }
          return res;
      }
  
      static class CustomSort implements Comparator<int[]> {
  
          public int compare(int[] a, int[] b)
          {
              return a[0] - b[0];
          }
      }
  
      static void printArr(int[] arr){
          for(int i=0;i< arr.length;i++)
          {
              System.out.print(arr[i] + " ");
          }
          System.out.println();
      }
  
      private static int lcm(int a, int b) {
          int gcd = gcd(a,b);
          return (int)((long)a*(long)b)/gcd ;
      }
  
  
      private static int gcd(int a, int b) {
          if(b == 0) return a;
          else return gcd(b , a % b);
      }
  
  
      private static void swap(int[] arr, int start, int rand_pivot) {
          int temp = arr[start];
          arr[start] = arr[rand_pivot];
          arr[rand_pivot] = temp;
      }
  
  
  }