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.*;
  public class Codeforces {
  
  
  	
   public static void main(String[] args) {
  
  Scanner sc=  new Scanner(System.in);
  while(sc.hasNext()) {
  
  int t = sc.nextInt();
  while(t-->0) {
     int n = sc.nextInt();
     StringBuilder ss = new StringBuilder();
     ss.append(n +" ");
     long val = n+1;
     while(n-->1) {
  	   ss.append(val +" ");
  	   
     val++;
     }
     System.out.println(ss);
     
   
   }	
  }
  
  }
  
  
  
  
  	
  
  
  
   
   static void primeFactors(long n , ArrayList<Integer> al) {
  	 while(n%2 == 0) {
  		 al.add(2);
  		 n  = n/2;
  	 }
  	
  	 for(int i = 3 ; i*i<= n;i+=2) {
  		 while(n%i == 0) {
  			 al.add(i);
  			 n = n/i;
  		 }
  	 }
  	
  	if(n>2) {
  		al.add((int) n);
  	}
   }
   
   
   
   static class Pair implements Comparable<Pair>{
  	 int a;
  	 int b;
  	 Pair(int a, int b){
  		 this.a = a;
  		 this.b = b;
  	 }
  	@Override
  	public int compareTo(Pair o) {
  		// TODO Auto-generated method stub
  	int temp =  this.a - o.a;
  	if(temp == 0) {
  	  return this.b - o.b;	
  	}
  	else {
  	return temp;	
  	}
  	
  	
  	}
  	 
  	 
   }
   
   
   
   
   static long gcd(long a ,  long b) {
  	 if(b == 0) {
  		 return a;
  	 }
  	 
  	 return gcd(b, a%b);
   }
   
   
    static boolean isPalindrome(int a[]) {
  	  int i= 0;
  	  int j = a.length - 1;
  	  
  	  while(i<=j) {
  		  if(a[i] != a[j]) {
  		      return false;	  
  		  }
  		  i++;
  		  j--;
  	  }
  	  
  	  return true;
  	  
    }
   
   
   
   static boolean isSubsequence(String a , String b) {
  	 
  	int i = 0 , j = 0;
  	while(i<a.length() && j<b.length()) {
  		
  		if(a.charAt(i) == b.charAt(j)) {
  			i++;
  			j++;
  		}
  		else {
  			j++;
  		}
  	}
  	
  	if(i == a.length()) {
  		return true;
  	}
  	return false;
  	
   }
  
   
   
   
   
   }
  
  
  
  
          
  
  
  
  
  		
  
  
          
  
  
  
  
  		