import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

from random import randrange

def isroot(p, r):
    seen = [0]*p
    a = 1
    for _ in range(p-1):
        if seen[a]: return False
        seen[a] = 1
        a = a*r%p
    return True

def solve():
    v, x = LI()
    p = v*x+1
    r = 2
    while not isroot(p, r):
        r = randrange(3, p)

    a = pow(r, v, p)
    ans = [a]
    for _ in range(x-1):
        ans.append(ans[-1]*a%p)

    ans.sort()
    print(*ans)

for _ in range(II()):
    solve()