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

const int MAXN = 1e6 + 3;

int W[MAXN]; bool P[MAXN];
int o = 1e6;

map <pair<int, int>, vector<int> > M;

int main(){
    // ios :: sync_with_stdio(false);
    // cin.tie(nullptr);

    for(int i = 2;i <= o;++ i){
        for(int j = 2;1ll * i * j <= o;++ j)
            P[i * j] = true;
    }

    W[1] = 1;

    for(int n = 1;n <= 20;++ n){
        vector <int> U;
        for(int i = 2;i <= n;++ i)
            if(!P[i])
                U.push_back(i);
        int m = 1 << U.size();
        for(int s = 0;s < m;++ s){
            int sum = 1, cnt = 0;
            for(int i = 2;i <= n;++ i){
                if(!P[i])
                    W[i] = (s & (1 << cnt)) ? 1 : -1, cnt ++;
                else {
                    for(int j = 2;j < i;++ j){
                        if(i % j == 0){
                            W[i] = W[j] * W[i / j];
                            break;
                        }
                    }
                }
                sum += W[i];
            }

            if(sum >= 0 && !M.count({n, sum})){
                vector <int> T;
                for(int i = 1;i <= n;++ i)
                    T.push_back(W[i]);
                M[{n, sum}] = T;
            }
        }
    }
    
    int T;
    cin >> T;
    for(int _ = 1;_ <= T;++ _){
        int n, k;
        cin >> n >> k;

        if(n <= 20){
            // cout << "here" << endl;
            if(M.count({n, k})){
                auto &T = M[{n, k}];
                for(auto &u: T)
                    cout << u << " ";
                cout << "\n";
            } else {
                cout << -1 << "\n";
            }

            continue;
        }

        for(int i = 1;i <= n;++ i)
            W[i] = 1;
        
        int m = ceil(sqrt(n));
        int w = n;

        for(int i = m;i <= n;++ i) if(!P[i]){
            int x = n / i;
            if(w - 2 * x >= k){
                w -= 2 * x;
                
                for(int j = 1;1ll * i * j <= n;++ j)
                    W[i * j] *= -1;
            }
        }

        if(w == k){
            for(int i = 1;i <= n;++ i)
                cout << W[i] << " \n"[i == n];
        } else {
            cout << -1 << "\n";
        }
    }
    return 0;;
}