#include using namespace std; using LL=long long; using ULL=unsigned long long; #define rep(i,n) for(int i=0; i<(n); i++) vector> factorize(ULL N){ vector> res; for(ULL i=2; i*i<=N; i++){ if(N%i) continue; res.push_back({i,0}); while(N%i==0){ N/=i; res.back().second++; } } if(N!=1) res.push_back({N,1}); return move(res); } ULL powm(ULL a,ULL i,ULL m){ if(i==0) return 1; ULL r=powm(a*a%m,i/2,m); if(i%2==1) r=r*a%m; return r; } ULL findg(ULL v,ULL x){ ULL m=x*v+1; auto F=factorize(x*v); ULL g=2; while(true){ bool ok=true; for(auto f:F) if(powm(g,x*v/f.first,m)==1) ok=false; if(ok) break; } return powm(g,v,m); } int main(){ int T; scanf("%d",&T); while(T--){ ULL v,x; scanf("%llu%llu",&v,&x); ULL m=v*x+1; ULL g=findg(v,x); vector ans={1}; rep(i,x-1) ans.push_back(ans.back()*g%m); sort(ans.begin(),ans.end()); rep(i,x){ if(i) printf(" "); printf("%u",(unsigned int)ans[i]); } printf("\n"); } return 0; }