#include<iostream>
#include<cstring>
#include<vector>
#include<cassert>
using namespace std;
using LL = long long;
const int maxn = 1e6 + 5;
bool isPrime[maxn];
int primes[maxn], minp[maxn], cnt;
void init(){
    isPrime[1] = 1;
    for(int i = 2; i < maxn; i++){
        if (!isPrime[i]){
            primes[cnt++] = i;
            minp[i] = i;
        }
        for(int j = 0; i * primes[j] < maxn; j++){
            minp[i * primes[j]] = primes[j];
            isPrime[i * primes[j]] = 1;
            if (i % primes[j] == 0) break;
        }
    }
}	

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    init();
    int T;
    cin >> T;
    while(T--){
        int n, k;
        cin >> n >> k;
        if ((n - k) % 2 == 1){
            cout << -1 << '\n';
            continue;
        }
        int need = (n - k) / 2;
        vector<int> p1;
        for(int i = 0; primes[i] * 2 <= n and p1.size() < 7; i++){
            p1.push_back(primes[i]);
        }
        vector<int> p2;
        for(int i = 1; i <= n; i++){
            if (i * 2 > n and !isPrime[i]){
                p2.push_back(i);
            }
        }
        vector<int> cnt(n + 1);
        for(int i = 1; i <= n; i++){
            int t = i;
            int x = 1;
            while(t > 1){
                int p = minp[t];
                int c = 0;
                while(t % p == 0) t /= p, c ^= 1;
                if (c) x *= p;
            }
            cnt[x] += 1;
        }
        for(int i = 1; i <= n; i++){
            for(int j = 2 * i; j <= n; j += i){
                cnt[i] += cnt[j];
            }
        }
        const int m = p1.size();
        bool ok = false;
        for(int i = 0; i < 1 << m; i++){
            vector<int> ps;
            for(int j = 0; j < m; j++){
                if (i >> j & 1){
                    ps.push_back(p1[j]);
                }
            }
            int S = ps.size();
            vector<int> mul(1 << S, 1), c(1 << S);
            for(int s = 1; s < 1 << S; s++){
                int lb = __lg(s);
                mul[s] = mul[s ^ (1 << lb)] * ps[lb];
            }
            for(int s = 0; s < 1 << S; s++){
                c[s] = cnt[mul[s]];
            }
            for(int t = 0; t < S; t++){
                for(int s = 0; s < 1 << S; s++){
                    if (s >> t & 1){
                        c[s ^ (1 << t)] -= c[s];
                    }
                }
            }
            int tot = 0;
            for(int s = 1; s < 1 << S; s++){
                if (__builtin_parity(s)){
                    tot += c[s];
                }
            }
            if (need >= tot and need <= tot + p2.size()){
                vector<int> ans(n + 1);
                for(int i = 0; i < need - tot; i++){
                    ans[p2[i]] = -1;
                }
                for(int i = 1; i <= n; i++){
                    if (i * 2 > n and !isPrime[i]){
                        if (ans[i] == 0) ans[i] = 1;
                        continue;
                    }
                    int c = 0;
                    int t = i;
                    for(auto x : ps){
                        while(t % x == 0) t /= x, c ^= 1;
                    }
                    ans[i] = c ? -1 : 1;
                }
                int sum = 0;
                for(int i = 1; i <= n; i++){
                    sum += ans[i];
                    cout << ans[i] << " \n"[i == n];
                }
                assert(sum == k);
                ok = true;
                break;
            }
        }
        if (!ok){
            cout << -1 << '\n';
        }
    }

}