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 math
  import os
  import sys
  from io import BytesIO, IOBase
  M = 1000000007
  import random
  import heapq
  import threading
  import bisect
  import time
  #sys.setrecursionlimit(2*(10**5))
  from functools import *
  from collections import *
  from itertools import *
  BUFSIZE = 8192
  import array
  class FastIO(IOBase):
      newlines = 0
      def __init__(self, file):
          self._fd = file.fileno()
          self.buffer = BytesIO()
          self.writable = "x" in file.mode or "r" not in file.mode
          self.write = self.buffer.write if self.writable else None
      def read(self):
          while True:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              if not b:
                  break
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines = 0
          return self.buffer.read()
      def readline(self):
          while self.newlines == 0:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              self.newlines = b.count(b"\n") + (not b)
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines -= 1
          return self.buffer.readline()
      def flush(self):
          if self.writable:
              os.write(self._fd, self.buffer.getvalue())
              self.buffer.truncate(0), self.buffer.seek(0)
  class IOWrapper(IOBase):
      def __init__(self, file):
          self.buffer = FastIO(file)
          self.flush = self.buffer.flush
          self.writable = self.buffer.writable
          self.write = lambda s: self.buffer.write(s.encode("ascii"))
          self.read = lambda: self.buffer.read().decode("ascii")
          self.readline = lambda: self.buffer.readline().decode("ascii")
  def print(*args, **kwargs):
      sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
      at_start = True
      for x in args:
          if not at_start:
              file.write(sep)
          file.write(str(x))
          at_start = False
      file.write(kwargs.pop("end", "\n"))
      if kwargs.pop("flush", False):
          file.flush()
  if sys.version_info[0] < 3:
      sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
  else:
      sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  input = lambda: sys.stdin.readline().rstrip("\r\n")
  def inp(): return sys.stdin.readline().rstrip("\r\n")  # for fast input
  def out(var): sys.stdout.write(str(var))  # for fast output, always take string
  def lis(): return list(map(int, inp().split()))
  def stringlis(): return list(map(str, inp().split()))
  def sep(): return map(int, inp().split())
  def strsep(): return map(str, inp().split())
  def fsep(): return map(float, inp().split())
  def inpu(): return int(inp())
  def build(a,b,st,arr,node):
      if a==b:
          st[node] = arr[a]
          return arr[a]
      mid = (a+b)//2
      p = build(a,mid,st,arr,2*node+1)
      q = build(mid+1,b,st,arr,2*node+2)
      st[node] = p+q
      return st[node]
  def update(st,a,b,x,val,node):
      if x<a or x>b:
          return
      st[node] = st[node] + val
      if a!=b:
          mid = (a+b)//2
          update(st,a,mid,x,val,2*node+1)
          update(st,mid+1,b,x,val,2*node+2)
  def getsum(st,a,b,l,r,node):
      if l>b or r<a:
          return 0
      if l<=a and r>=b:
          return st[node]
      mid = (a+b)//2
      return getsum(st,a,mid,l,r,2*node+1) + getsum(st,mid+1,b,l,r,2*node+2)
  def dfs2(curr,parent,start,end,cnt,res,d,arr):
      res[cnt[0]] = arr[curr-1]
      start[curr] = cnt[0]
      cnt[0]+=1
      for i in d[curr]:
          if i!=parent:
              dfs2(i,curr,start,end,cnt,res,d,arr)
              cnt[0]+=1
      res[cnt[0]] = arr[curr-1]
      end[curr] = cnt[0]
  
  """-------------------Subtree queries problem on cses
  def main():
      t = 1
      #t = inpu()
      for _ in range(t):
          n,q = sep()
          arr = lis()
          d = defaultdict(list)
          for i in range(n-1):
              a,b = sep()
              d[a].append(b)
              d[b].append(a)
          res = [0]*(2*n)
          start = defaultdict(int)
          end = defaultdict(int)
          cnt = [0]
          dfs2(1,-1,start,end,cnt,res,d,arr)
          print(res)
          st=[0]*(4*(len(res)))
          build(0,len(res)-1,st,res,0)
          #print(st)
          for i in range(q):
              l = lis()
              if l[0]==1:
                  p,q = start[l[1]],end[l[1]]
                  diff = l[2] - res[p]
                  res[p] = l[2]
                  diff2 = l[2] - res[q]
                  res[q] = l[2]
                  update(st,0,len(res)-1,p,diff,0)
                  update(st,0,len(res)-1,q,diff2,0)
              else:
                  p,q = start[l[1]],end[l[1]]
                  print(getsum(st,0,len(res)-1,p,q,0)//2)
  """
  def prime(n):
      for i in range(2,n):
          if n%i==0:
              return False
      return True
  def main():
      t=1
      t=inpu()
      for _ in range(t):
          n = inpu()
          ans= []
          flag = 0
          while(True):
              for i in range(2,10000):
                  if prime(i)==True:
                      ans.append(i)
                  if len(ans)==n:
                      flag = 1
                      break
              if flag==1:
                  break
          print(*ans)
  if __name__ == '__main__':
      """
      threading.stack_size(2 * 10 ** 8)
      threading.Thread(target=main).start()
      """
      main()
  