#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=INF;
const ll MAX=140010;




signed main(){
    ll t;cin>>t;
    while(t--){
        ll v,x;
        cin>>v>>x;
        if(x==1){
            cout<<1<<endl;
            continue;
        }
        ll p=x*v+1;
        for(int i=1;i<=p-1;i++){
            vector<bool>used(p);
            ll now=1;
            bool f=0;
            rep(j,x){
                if(used[now])f=1;
                used[now]=1;
                now=i*now%p;
            }
            if(f==0){
                now=1;
                vector<ll>ans(0);
                ll sum=0;
                rep(j,x){
                    sum+=now;
                    ans.pb(now);
                    now=now*i%p;
                }
                if(sum%p!=0)continue;
                sort(all(ans));
                rep(j,x){
                    cout<<ans[j]<<' ';
                }
                cout<<endl;
                break;
            }
        }
    }
}