def func(n):
  s=set()
  for i in range(2,int(n**0.5)+1):
    if n%i==0:
      s.add(i)
      s.add(n//i)
  return s

from random import randint
def main(u,x):
  p=x*u+1
  if u==1:return list(range(1,p))
  if x==1:return [x]
  # p:prime
  # a^(p-1)=1 mod p
  # p=x*u+1
  # a^(x*u)=1 mod p
  # (a^u)^x=1 mod p
  ss=func(p-1)
  f=p-1-len(ss)
  while True:
    i=randint(2,p-2)
    s={i}
    flg=True
    for xx in ss:
      if pow(i,xx,p)!=1:
        continue
      else:
        flg=False
        break
    if flg:break
  i=pow(i,u,p)
  ary=[]
  ii=i
  for _ in range(x):
    ary.append(ii)
    ii=ii*i%p
  ary.sort()
  return ary
if __name__=='__main__':
  t=int(input())
  cases=[list(map(int,input().split())) for _ in range(t)]
  for u,x in cases:
    ret=main(u,x)
    print(*ret)