#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

ll modpow(ll a, ll n,ll mo) {
	ll r=1;a%=mo;
	while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1;
	return r;
}

int T;
int V,X;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>T;
	while(T--) {
		cin>>V>>X;
		int P=V*X+1;
		
		if(P==2) {
			cout<<1<<endl;
			continue;
		}
		vector<int> cand;
		for(i=2;i*i<=P;i++) if(P%i==0) {
			cand.push_back(i);
			cand.push_back(P/i);
		}
		
		
		int q=0;
		set<int> S;
		while(1) {
			q=rand()%(P-1)+1;
			int ok=1;
			FORR(c,cand) if(modpow(q,c,P)==q) ok=0;
			if(ok==0) continue;
			FOR(i,X) S.insert(modpow(q,V*(i+1),P));
			break;
		}
		
		FORR(v,S) cout<<v<<" ";
		cout<<endl;
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}