import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write #import pypyjit #pypyjit.set_param('max_unroll_recursion=-1') #sys.set_int_max_str_digits(10**9) def Primitive_Root(p): if p==2: return 1 if p==167772161: return 3 if p==469762049: return 3 if p==754974721: return 11 if p==998244353: return 3 if p==10**9+7: return 5 divisors=[2] pp=(p-1)//2 while pp%2==0: pp//=2 for d in range(3,pp+1,2): if d**2>pp: break if pp%d==0: divisors.append(d) while pp%d==0: pp//=d if pp>1: divisors.append(pp) primitive_root=2 while True: for d in divisors: if pow(primitive_root,(p-1)//d,p)==1: break else: return primitive_root primitive_root+=1 T=int(readline()) for t in range(T): v,x=map(int,readline().split()) p=Primitive_Root(v*x+1) pow_p=pow(p,v,v*x+1) ans_lst=[1] for _ in range(1,x): ans_lst.append((ans_lst[-1]*pow_p-1)%(v*x+1)+1) ans_lst.sort() print(*ans_lst)