#include<bits/stdc++.h>
using namespace std;
using i64 = long long;


struct solution{
    int n, k, x;
    vector<bool> neg, vis;

    inline int doit(int x){
        int res = 0;
        for (i64 i = x; i <= n; i *= x){
            for (int j = i; j <= n; j += i){
                vis[j] = true;
                neg[j] = !neg[j];
                res += neg[j] ? 1 : -1;
            }
        }
        return res;
    }

    solution(){
        cin >> n >> k;
        // n = nn, k = kk;
        if ((n - k) % 2) {
            cout << -1 << '\n';
            return;
        }
        x = (n - k) / 2;
        neg.assign(n + 1, false);
        vis.assign(n + 1, false);

        int sum = 0;
        for (int i = 2; i <= n; i++) {
            if (vis[i]) continue;
            int cnt = doit(i);
            if(cnt < 0){
                // cout << i << endl;
                continue;
                // assert(cnt >= 0);
            }
            if (sum + cnt > x) doit(i);
            else sum += cnt;
        }

        for (int i = 1; i <= n; i++) {
            cout << (neg[i] ? -1 : 1) << ' ';
        }
        // cout << n - sum * 2;
        cout << '\n';

    }
};

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T; cin >> T;
    while (T--) solution();
    // for (int i = 2; i <= 100; i+=2) solution(100'000, i);
    return 0;
}