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: /* JAIKARA SHERAWAALI DA BOLO SACHE DARBAR KI JAI
  HAR HAR MAHADEV JAI BHOLENAATH
  Rohit Kumar 
  NIT JAMSHEDPUR
  */
  
  import java.util.*;
  
  import java.io.*;
  
  public class Main
  {   
        
     static class FastReader{
  
         BufferedReader br;
         StringTokenizer st;
  
         public FastReader(){
  
         br=new BufferedReader(new InputStreamReader(System.in));
  
  
         }
  
         String next(){
  
         while(st==null||!st.hasMoreTokens()){
           
           try{
  
            st=new StringTokenizer(br.readLine());
  
           }
           catch(IOException e){
  
              e.printStackTrace();
           }
             
  
  
  
         }
         return st.nextToken();}
  
        long nextLong(){ return Long.parseLong(next());}
  
        int nextInt(){ return Integer.parseInt(next());}
  
  
         }
       
     static <t>void print(t o){
      System.out.println(o);
     }
      
     static boolean islapindrome(String s){
  
         int fhalf[]=new int[26];
         int shalf[]=new int[26];
  
          int i=0,j=s.length()-1;
          while(i<j){
             fhalf[s.charAt(i)-'a']++;
             shalf[s.charAt(j)-'a']++;
     i++;
     j--;
     
  
          }
  
          for(int k=0;k<26;k++){
            if(fhalf[k]!=shalf[k])return false;
          }
      return true;
  
  
  
  
     }
  
      static int mod=(int)1e9+7;
    static String text="foo";
    public static void main (String args[]) throws IOException{
    try{
      System.setIn(new FileInputStream("input.txt"));
      System.setOut(new PrintStream(new FileOutputStream("output.txt"))); } 
      catch (Exception e) {
      System.err.println("Error");
       }
       
       
       FastReader sc=new FastReader();
       int t=sc.nextInt();
        while(t-->0)
        {
           int n=sc.nextInt();
           if(n==1)
           {
               System.out.println(1);
               continue;
           }       
           long k=2;
            for(int i=0;i<n;i++)
            {
                System.out.print(k+" ");
                k++;
            }
            
  
  
  
  
  
  
          //  int arr[]=new int[n];
          //  for(int i=0;i<n;i++)
          //  {
          //      arr[i]=sc.nextInt();
          //  }
            System.out.println();
          
  
  
        } 
  
  
         
  
  
  
  
      }
  
     
            void sieveOfEratosthenes(int n)
      {
          boolean prime[] = new boolean[n+1];
          for(int i=0;i<=n;i++)
              prime[i] = true;
           
          for(int p = 2; p*p <=n; p++)
          {
              if(prime[p] == true)
              {
                  for(int i = p*p; i <= n; i += p)
                      prime[i] = false;
              }
          }
          for(int i = 2; i <= n; i++)
          {
              if(prime[i] == true)
                  System.out.print(i + " ");
          }
      }
      static long gcd(long a,long b)
      {
          if(b==0) return a;
          
          return gcd(b,a%b);
      }
      static boolean isprime(int n)
      {
          if(n<=1)
           return false;
          
          if(n<=3)
           return true;
          
          if(n%2==0||n%3==0)
           return false;
          
          for(int i=5;i*i<=n;i=i+6)
          {
              if(n%i==0||n%(i+2)==0)
                return false;
          }
          return true;
      }
  
  
  
     }
   