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 itertools
  from math import floor, log, log2, ceil, sqrt
  from itertools import groupby
  from decimal import Decimal,getcontext
  import sys
  from collections import deque
   
  
  primes = set()
  maxN = 1000001
  def generatePrimes():
    used = [False] * maxN
    for i in range(2, maxN):
      if not used[i]:
        primes.add(i)
        for j in range(i, maxN, i):
          used[j] = True
  def isPrime(n):
    if n < 2:
      return True
    x = 2
    while x * x <= n:
      if n % x == 0:
        return False
      x += 1
    return True
  
  t = int(input())
  res = []
  # generatePrimes()
  for _ in range(t):
    n = int(input())
    # [n, e] = list(map(int, input().split()))
    ans = " ".join(map(str, range(2, n + 2)))
    # print(ans)
    
    # print(" ".join(map(str, ans)))
    # print(ans)
    res.append(ans)
   
  for i in range(t):
    print(res[i])