///////////////////////////////////////////////////////////////////////////////

#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

///////////////////////////////////////////////////////////////////////////////

#define DEBUG 0

#define pb push_back
#define V vector
#define S static

#define rep(i,n) for(ll i=0LL; i<n; ++i)
#define srep(i,s,n) for(ll i=s; i<n; ++i)
#define rrep(i,n) for(ll i=n-1LL; i>=0LL; --i)
#define rfrep(i,f,n) for(ll i=n-1LL; i>=f; --i)
#define cfor(i,x) for(const auto & (i) : (x))
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CIN(x) do { \
        assert(!cin.eof()); \
        cin >> x; \
        assert(!cin.fail()); \
} while(0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG

typedef long long ll;
typedef unsigned long long ull;
typedef __int128_t ll128;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T> >;
template <typename T>
using binary_search_tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

///////////////////////////////////////////////////////////////////////////////

void llin(ll &a)
{
    CIN(a);
}

void llinl1(V<ll> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a;
        CIN(a);
        v.push_back(a);
    }
}

void llinl2(V<t2> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b;
        CIN(a >> b);
        v.push_back(t2(a, b));
    }
}

void llinl3(V<t3> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c;
        CIN(a >> b >> c);
        v.push_back(t3(a, b, c));
    }
}

void llinl4(V<t4> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c, d;
        CIN(a >> b >> c >> d);
        v.push_back(t4(a, b, c, d));
    }
}

void llina(V<ll> &v, ll count)
{
    llinl1(v, count);
}

template <typename T>
void sort(V<T> &v)
{
    sort(v.begin(), v.end());
}

template <typename T>
void sort_reverse(V<T> &v)
{
    sort(v.begin(), v.end(), greater<T>());
}

t2 _ext_gcd(ll a, ll b, ll g)
{
    if (!b) return t2(1, 0);
    ll q = a / b;
    ll r = a % b;
    t2 sol = _ext_gcd(b, r, g);
    ll sx = get<0>(sol);
    ll sy = get<1>(sol);
    ll x = sy;
    ll y = sx - q * sy;
    return t2(x, y);
}

t2 ext_gcd(ll a, ll b)
{
    return _ext_gcd(a, b, gcd(a, b));
}

// x and mod must be coprime
ll mod_inv(ll x, ll mod)
{
    t2 result = ext_gcd(x, mod);
    ll ret = get<0>(result);
    while (ret < 0) ret += mod;
    ret %= mod;
    return ret;
}

ll msec()
{
    struct timeval tv;
    gettimeofday(&tv, NULL);
    ll ret = 0;
    ret += tv.tv_sec * 1000LL;
    ret += tv.tv_usec / 1000LL;
    return ret;
}

void gcj_head(ll casenum)
{
    cout << "Case #" << casenum+1 << ":";
}

void gcj_head_nl(ll casenum)
{
    cout << "Case #" << casenum+1 << ":" << "\n";
}

template <typename T>
void _debug_print(T x)
{
    cout << x << " ";
}

template <typename T1, typename T2>
void _debug_print(tuple<T1, T2> x)
{
    T1 x1 = get<0>(x);
    T2 x2 = get<1>(x);
    cout << "(" << x1 << ", " << x2 << ") ";
}

template <typename T1, typename T2, typename T3>
void _debug_print(tuple<T1, T2, T3> x)
{
    T1 x1 = get<0>(x);
    T2 x2 = get<1>(x);
    T3 x3 = get<2>(x);
    cout << "(" << x1 << ", " << x2 << ", " << x3 << ") ";
}

template <typename T1, typename T2, typename T3, typename T4>
void _debug_print(tuple<T1, T2, T3, T4> x)
{
    T1 x1 = get<0>(x);
    T2 x2 = get<1>(x);
    T3 x3 = get<2>(x);
    T4 x4 = get<3>(x);
    cout << "(" << x1 << ", " << x2 << ", " << x3 << ", " << x4 << ") ";
}

template <typename T>
void _debug_print(T xarray[], ll n)
{
    rep (i, n) _debug_print(xarray[i]);
    cout << endl;
}

template <typename T>
void _debug_print(const V<T> &xlist)
{
    for (auto x : xlist) _debug_print(x);
    cout << endl;
}

template <typename T>
void _debug_print(const set<T> &xset)
{
    for (auto x : xset) _debug_print(x);
    cout << endl;
}

template <typename TT, typename T>
void _debug_print(const map<TT, T> &xlist)
{
    for (auto x : xlist) {
        TT k = x.first;
        T v = x.second;
        cout << "K=";
        _debug_print(k);
        cout << " V=";
        _debug_print(v);
        cout << endl;
    }
}




// O(log(exp))
ll mod_pow(ll base, ll exp, ll mod)
{
    ll ret = 1LL;

    for ( ; exp; ) {
        if (exp & 1LL) {
            ret *= base;
            ret %= mod;
        }
        base = (base * base) % mod;
        exp >>= 1;
    }

    return ret;
}

ll mod_mlt(ll x, ll y, ll mod)
{
    ll ret = 0LL;
    x %= mod;

    while (y) {
        if (y & 1LL) {
            ret += x;
            ret %= mod;
        }
        y >>= 1;
        x <<= 1;
        x %= mod;
    }

    return ret;
}

// returns t2(solution, mod)
t2 chinese_remainder(ll a1, ll m1, ll a2, ll m2)
{
    assert(a1 >= 0);
    assert(m1 > 0);
    assert(a2 >= 0);
    assert(m2 > 0);

    ll mgcd = gcd(m1, m2);
    if (a1 % mgcd != a2 % mgcd) return t2(0, 0);
    ll mlcm = m1 * m2 / mgcd;
    t2 z = ext_gcd(m1, m2);
    ll z1 = get<0>(z);
    ll z2 = get<1>(z);

    // ll x = a1 + ((a2 - a1) / mgcd) * m1 * z1;

    ll x = z1;
    while (x < 0) x += mlcm;

    x = mod_mlt(x, m1, mlcm);

    ll coef = (a2 - a1) / mgcd;
    while (coef < 0) coef += mlcm;
    x = mod_mlt(x, coef, mlcm);

    x += a1;
    x %= mlcm;

    return t2(x, mlcm);
}

void get_divisors(V<ll> &retlist, ll x)
{
    for (ll i = 1LL; i < sqrt(x) + 3LL; ++i) {
        if (x % i == 0LL) {
            retlist.push_back(i);
            retlist.push_back(x / i);
        }
    }
}

// returns factors and 1
void get_factors(V<ll> &retlist, ll x)
{
    retlist.pb(1LL);
    for (ll i = 2LL; i < (ll)(sqrt(x)) + 3LL; ++i) {
        while (x % i == 0LL) {
            retlist.pb(i);
            x /= i;
        }
    }
    retlist.pb(x);
}

bool is_prime(ll x)
{
    V<ll> factors, factors2;

    get_factors(factors, x);

    for (auto factor : factors) {
        if (factor > 1) factors2.pb(factor);
    }

    return factors2.size() == 1 && x == factors2[0];
}

void eratosthenes(set<ll> &primes, ll n)
{
    bool *is_not_prime = new bool[n+3LL];
    memset(is_not_prime, 0, sizeof(bool) * (n+3LL));

    srep (v, 2LL, (ll)sqrt(n)+10LL) {
        if (is_not_prime[v]) continue;
        for (ll vv = v * 2LL; vv <= n; vv += v) {
            is_not_prime[vv] = true;
        }
    }

    srep (v, 2LL, n+1LL) if (!is_not_prime[v]) primes.insert(v);

    delete [] is_not_prime;
}

// p must be prime
ll mod_root(ll p)
{
    if (p == 2) return 1;
    if (p == 3) return 2;

    V<ll> flist;
    get_factors(flist, p-1LL);
    set<ll> fs;
    for (auto f : flist) if (f > 1) fs.insert(f);

    srep (a, 2, p) {
        bool ok = true;
        for (auto f : fs) {
            if (mod_pow(a, (p-1LL) / f, p) == 1) {
                ok = false;
                break;
            }
        }
        if (ok) return a;
    }

    assert(false);
}

ull combination(ll x, ll y)
{
    if (y > x / 2LL) y = x - y;

    ull ret = 1LL;
    for (ll i = 0LL; i < y; ++i) {
        ret *= x--;
        ret /= (i + 1LL);
    }

    return ret;
}

// count of integers coprime with x (1<=k<=x)
ll euler_phi(ll x)
{
    V<ll> flist;
    get_factors(flist, x);

    map<ll, ll> fcnts;
    cfor (f, flist) {
        if (f == 1) continue;
        fcnts[f]++;
    }

    ll ret = 1;
    cfor (item, fcnts) {
        ll f = item.first;
        ll fc = item.second;
        ll a = 1;
        rep (xx, fc) a *= f;
        ll b = 1;
        rep (xx, fc-1) b *= f;
        ret *= a - b;
    }

    return ret;
}

#if 0

// (base[0] * x^0 + base[1] * x^1 + base[2] * x^2 + ... ) / (div[0] * x^0 + div[1] * x^1 + div[2] * x^2 + ... )
void polynomial_div(V<mint> &q, V<mint> &r, V<mint> base, V<mint> div)
{
    ll blen = base.size();
    ll dlen = div.size();
    reverse(ALL(base));
    reverse(ALL(div));

    mint basemlt = div[0];
    basemlt.inv();

    rep (i, blen - dlen + 1) {
        mint mlt = basemlt * base[i];
        rep (j, dlen) base[i+j] -= div[j] * mlt;
        q.pb(mlt);
    }
    reverse(ALL(q));

    ll idx = blen;
    rep (xxx, dlen - 1) r.pb(base[--idx]);
}

#endif



///////////////////////////////////////////////////////////////////////////////

void _main();
int main()
{
    cout << setprecision(12);
#if !DEBUG
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif

    _main();
    return 0;
}

// * cause of WA
// ** map<ll, ll> maps; ll val = maps[non-existent-key];
// ** memory initialization: ll costs[10]; memset(costs, 0, sizeof(bool) * 10);
// ** skip enqueue when graph BFS/DFS
// ** not apply mod 998244353
//       [bad]  cout << 10000LL * 10000LL << endl;
//       [good] cout << mint(10000LL * 10000LL) << endl;
// ** array length is too short
//       [bad]  ll anslist[3000];
//       [good] ll anslist[300010];
// ** overflow
//       [bad] ll total = 1e15; ll mlt = 1e5; ll ans = total * mlt;
// ** multiset.erase()
//       {1, 1, 2, 2, 3, 3}.erase(2) -> {1, 1, 3, 3}
// * cause of TLE
// ** rep (i, too_many_cnt) debug_printf(....);
// ** for (auto s : slist) { ...; } <-- each s is big string
// ** rep (i, many_cnt) cout << ans[i] << endl;
//       --> [good] string ansstr; rep (i, many_cnt) ansstr += ans[i] + "\n"; cout << ansstr;

void solve()
{
    ll v; llin(v);
    ll x; llin(x);
    ll mod = x * v + 1LL;

    ll r = mod_root(mod);
    ll a = 1;
    V<ll> anslist;

    rep (xxx, x) {
        anslist.pb(a);
        a *= mod_pow(r, v, mod);
        a %= mod;
    }

    sort(anslist);

    cfor (ans, anslist) cout << ans << " ";
    cout << "\n";
}

void _main()
{
    ll t; llin(t);
    rep (i, t) solve();

}

///////////////////////////////////////////////////////////////////////////////