""" v,2v,3v…みたいな? mod xv+1 で考えればよい 後、順番は最後に並べ直せばよい 総和がxv+1の倍数 """ import sys from sys import stdin import math def solve(lis,v,x): mod = v*x+1 now = 0 for j in lis: now += pow(j,x,mod) if now % mod != x: return False for i in range(1,x): now = 0 for j in lis: now += pow(j,i,mod) if now % mod != 0: return False return True TT = int(stdin.readline()) for loop in range(TT): v,x = map(int,stdin.readline().split()) mod = v*x+1 for j in range(x*v+1,0,-1): if pow(j,x,mod) == 1: a = [pow(j,i,mod) for i in range(x)] a.sort() print (*a) #print (v,x,a,file=sys.stderr) break """ TT = int(stdin.readline()) for loop in range(TT): v,x = map(int,stdin.readline().split()) mod = v*x+1 for i in range(2,x*v+1): if pow(i,x,mod) == 1: a = [pow(i,j,mod) for j in range(x)] a.sort() print (*a) break """