/*

Author: Haze

2024/9/2

*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define drep(i, r, l) for(int i = (r); i >= (l); -- i)
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr);
using namespace std;
typedef long long ll;
#define int long long

inline ll readL() {
    ll s = 0;
    bool fl = false;
    char ch = (char) getchar();
    while (!isdigit(ch)) {
        if (ch == '-')fl = true;
        ch = (char) getchar();
    }
    while (isdigit(ch)) {
        s = s * 10 + (ch ^ 48);
        ch = (char) getchar();
    }
    return fl ? -s : s;
}

inline int read() {
    return (int) (readL());
}

const int mod = 1000000000 + 7;
const int itinf = 1000000999;
const ll llinf = 2e18;
const int N = 1000099;
int isp[N];
vector<int> pri;


map<array<int, 2>, int> F;

void solve(ll n, ll k) {
    if ((n - k) & 1) {
        cout << "-1\n";
        return;
    }
    ll g = (n - k) / 2;
    vector<int> key(n + 1, 1);
    vector<array<int, 2>> choice;
    for (int i = 2; i <= n; ++i) {
        if (i * i > n and isp[i] == 0) {
            choice.push_back({i, n / i});
            if (g >= n / i) {
//                cerr << i << ' ' << g << ' ' << n / i << endl;
                int fl = -1;
                for (int c = i; c <= n; c += i) {
                    key[c] = fl;
                    fl *= -1;
                }
                g -= n / i;
            }
        }
    }


    if (g > 0) {
        vector<int>arr(n + 1);
        ll mask = F[{n, k}];
//        cerr << n << ' ' << k << ' ' << mask << endl;
        for (int i = 0; pri[i] <= n; ++i) {
            if (mask & (1 << i)) {
                arr[pri[i]] = -1;
            } else arr[pri[i]] = 1;
        }
        arr[1] = 1;

        irep(i, 1, n) {
            for (int j = 2; j <= i; ++j) {
                if (isp[i] == 0){
                    if(arr[i] == 0)arr[i] = 1;
                    break;
                }
                if (i % j == 0) {
                    arr[i] = arr[j] * arr[i / j];
                    break;
                }
            }
            cout << arr[i] << ' ';
        }
        cout << '\n';
    }
    else{
        irep(i, 1, n){
            cout << key[i] << " \n"[i == n];
        }
    }
}


signed main() {
    // IOS
    irep(i, 2, 1000000) {
        if (isp[i] == 0) {
            pri.push_back(i);
        }
        for (int x: pri) {
            if (1ll * x * i > 1000000)break;
            isp[x * i] = 1;
        }
    }
    std::mt19937 rnd(std::chrono::system_clock::now().time_since_epoch().count());
//    int cc = 100000;
    irep(mask, 0, 1 << 16) {
        vector<int> arr(201, 0);
        for (int i = 0; pri[i] < 200; ++i) {
            if (mask & (1 << i)) {
                arr[pri[i]] = -1;
            } else arr[pri[i]] = 1;
        }

        arr[1] = 1;
        ll sum = 0;
        irep(i, 1, 200) {
            for (int j = 2; j <= i; ++j) {
                if (isp[i] == 0){
                    if(arr[i] == 0)arr[i] = 1;
                    break;
                }
                if (i % j == 0) {
                    arr[i] = arr[j] * arr[i / j];
                    break;
                }
            }
            sum += arr[i];
            F[{i, sum}] = mask;

        }
    }

    int T = read();
    irep(i, 1, T){
        ll n, k;
        cin >> n >> k;
        solve(n, k);
    }
    return 0;
}