T = int(input())
for _ in range(T):
    v,x = map(int,input().split())
    p = v*x + 1
    for i in reversed(range(1,p+1)):
        if pow(i,x,p) != 1:
            continue
        S = set([])
        S.add(i)
        ni = i*i%p
        while ni not in S:
            S.add(ni)
            ni = ni*i%p
        #print(i,S)
        if len(S) == x:
            L = list(S)
            L.sort()
            print(*L)
            break