#include <bits/stdc++.h>
using namespace std;
using LL=long long;
using ULL=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

int sieve[401]={};
vector<ULL> P;

vector<pair<ULL,ULL>> factorize(ULL N){
  vector<pair<ULL,ULL>> res;
  for(ULL p:P){
    if(p*p>N) break;
    if(N%p) continue;
    res.push_back({p,0});
    while(N%p==0){ N/=p; 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);
  ULL g=2;
  while(true){
    bool ok=true;
    for(auto f:F) if(powm(g,x/f.first,m)==1) ok=false;
    if(ok) break;
    g++;
  }
  ULL res=g, ig=powm(g,x,m), i=ig;
  while(i!=1){ res=res*g%m; i=i*ig%m; } 
  return res;
}

int main(){
  sieve[0]=sieve[1]=1;
  for(int i=2; i<=400; i++){
    if(sieve[i]!=0) continue;
    sieve[i]=i;
    if(i<=20) for(int j=i*i; j<=20; j+=i) sieve[j]=i;
  }
  for(int i=2; i<=400; i++) if(sieve[i]==i) P.push_back(i);

  int T; scanf("%d",&T);
  while(T--){
    ULL v,x; scanf("%llu%llu",&v,&x);
    if(x==1){ printf("1\n"); continue; }
    ULL m=v*x+1;
    ULL g=findg(v,x);
    vector<ULL> 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;
}