#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
mt19937 rnd(time(0));

const int N=1e6+3;
int pri[N],cnt,p[N];
bool np[N];
void sieve(int n){
	for(int i=2;i<=n;++i){
		if(!np[i])pri[++cnt]=i,p[i]=i;
		for(int j=1;j<=cnt&&i*pri[j]<=n;++j){
			p[i*pri[j]]=pri[j];
			np[i*pri[j]]=1;
			if(!(i%pri[j]))break;
		}
	}
}
int n,k,mg,f[N],s[N];
bool flag;
void large(){
	int now=0;
	for(int i=1;i<=n;++i){
		int x=i,pr=1;
		while(x>1)pr*=f[p[x]],x/=p[x];
		if(pr)f[i]=pr,now+=pr;
		//cout<<"f["<<i<<"]="<<f[i]<<'\n';
	}
	for(int i=1;i*i<=n||i<=pri[mg];++i)s[i]=s[i-1]+f[i];
	for(int i=mg+1;pri[i]<=n;++i){
		int sum=s[n/pri[i]];
		if(sum>=0&&now<=k||sum<0&&now>k)f[pri[i]]=1,now+=sum;
		else f[pri[i]]=-1,now-=sum;
	}
	if(now==k){
		for(int i=1;i<=n;++i)if(!f[i]){
			int x=i,pr=1;
			while(x>1)pr*=f[p[x]],x/=p[x];
			f[i]=pr;
		}
		flag=1;
	}
}
void dfs(int k){
	if(k>mg){
		large();
		return;
	}
	f[pri[k]]=1;
	dfs(k+1);
	if(flag)return;
	f[pri[k]]=-1;
	dfs(k+1);
}

void solve(){
	cin>>n>>k;
	if((k+n)&1){
		cout<<"-1\n";
		return;
	}
	f[1]=1;
	mg=10;
	while(pri[mg]*pri[mg]<n)++mg;
	while(pri[mg]>n)--mg;
	if(n<=1000){
		flag=0;
		dfs(1);
		if(flag){
			for(int i=1;i<=n;++i)cout<<f[i]<<' ';
			cout<<'\n';
		}
		else{
			cout<<"-1\n";
		}
	}
	else{
		for(int i=1;i<=mg;++i)f[pri[i]]=1;
		large();
		for(int i=1;i<=n;++i)cout<<f[i]<<' ';
		cout<<'\n';
	}
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);
	sieve(1e6);
	int T;
	cin>>T;
	while(T--)solve();
}