/*
* @Author: zxxzy
* @Date:   2023-07-20 15:10:02
*/
#include <iostream>
#include <algorithm>
#include <cstring>
#include <bitset>
#include <set>
#include <cmath>
#include <vector>
#include <map>
//#define int long long
#define space ' '
#define endl '\n'
#define de(x) cout<<"** "<<x<<" **"<<endl;
#define N 1000005
using namespace std;
using ll=long long;
const int mod=998244353;
const int INF=0x3f3f3f3f;
const double eps=1e-6;

int prime[N],vis[N],cnt=0;
void getmu(){
    for(int i=2;i<=N-5;i++){
        if(!vis[i]){
            prime[++cnt]=i;
        }
        for(int j=1;j<=cnt&&prime[j]*i<=N-5;j++){
            vis[i*prime[j]]=1;
            if(i%prime[j]==0)break;
        }
    }
}
vector<int> vec[N];
vector<int> bin[N];
signed main(){
    #ifdef LOCAL
        freopen("D:\\code2023\\test\\input.txt", "r", stdin);
        freopen("D:\\code2023\\test\\output.txt", "w", stdout);
    #endif
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    getmu();
    int T;
    cin>>T;
    while(T--){
        int n,k;
        cin>>n>>k;
        if((n+k)%2!=0){
            cout<<-1<<endl;
            continue;
        }
        for(int i=1;i<=n;i++){
            vec[i].clear();
            bin[i].clear();
        }
        for(int i=2;i<=n;i++){
            if(!vis[i]){
                for(int j=i;j<=n;j++){
                    vec[j].push_back(i);
                }
            }
        }
        for(int i=1;i<=n;i++){
            vector<int> s;
            int now=i;
            for(auto t:vec[i]){
                int ccnt=0;
                while(now%t==0){
                    ccnt++;
                    now/=t;
                }
                if(ccnt&1){
                    s.push_back(t);
                    bin[t].push_back(i);
                }
            }
            vec[i]=s;
        }
        vector<int> f(n+1);
        f[1]=1;
        for(int i=1;i<=n;i++){
            if(vec[i].size()%2==0){
                f[i]=1;
            }else{
                f[i]=-1;
            }
        }
        int sum=0;
        for(int i=1;i<=n;i++){
            sum+=f[i];
        }
        if(sum>k){
            cout<<-1<<endl;
            continue;
        }
        if(sum==k){
            for(int i=1;i<=n;i++){
                cout<<f[i]<<space;
            }
            cout<<endl;
            // de(3)
            continue;
        }
        int now=0;
        int flag=0;
        for(int kk=1;kk<=cnt;kk++){
            int tmp=0;
            for(auto s:bin[prime[kk]]){
                f[s]=-f[s];
                tmp+=f[s];
            }
            if(sum+2*tmp==k){
                for(int i=1;i<=n;i++){
                    cout<<f[i]<<space;
                }
                cout<<endl;
                flag=1;
                break;
            }
            if(sum+2*tmp>k){
                now=kk;
                for(auto s:bin[prime[kk]]){
                    f[s]=-f[s];
                    tmp+=f[s];
                }
                break;
            }
            sum+=2*tmp;
        }
        if(flag){
            continue;
        }
        vector<int> fre;
        for(int i=max(prime[now+1],n/2);i<=n;i++){
            if(!vis[i]&&vec[i].size()==1){
                fre.push_back(i);
            }
        }
        int need=(sum-k)/2;
        if(fre.size()<need){
            cout<<-1<<endl;
        }else{
            for(int i=0;i<need;i++){
                f[fre[i]]=-f[fre[i]];
            }
            for(int i=1;i<=n;i++){
                cout<<f[i]<<space;
            }
            cout<<endl;
        }
    }

    return 0;
}