#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repp(i,a,b) for(ll i=a;i<b;i++)
#define reff(i,a,b) for(ll i=a;i>b;i--)
#define ll long long int
#define pll pair<ll,ll>
#define Fill(a,x) memset(a,x,sizeof(a))
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define M 1000000007
#define dbg(a)         std::cerr<<#a<<"="<<(a)<<"\n"
#define dbg1(a,b)       std::cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define dbg2(a,b,c)     std::cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define dbg3(a,b,c,d)   std::cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
 #define pos(c) ((c<='9' && c>='0')?c-'0':c-'A'+10 )
 #define co cout<<"abc"<<endl;
ll power(ll x,ll y)
{
    ll ans=1;
    while(y>0){
        if(y&1)
            ans=(ans*x)%M;
        x=(x*x)%M;
        y/=2;
    }
    return ans;
}
ll dx[] = {1,1,0,-1,-1,-1,0,1}, dy[] = {0,1,1,1,0,-1,-1,-1};
const int INF = 2034567891;
const ll INF64 = 1234567890123456789ll;
const long double pi = 3.1415926535897932384626434;
int main()
{
	ll t;
	cin>>t;
	while(t--)
	{
		ll l,c;
		cin>>l>>c;
		ll a[l+1];
		if(c>(l*(l-1)/2))
		cout<<"-1"<<endl;
		else
		{
			ll mi=0;
			ll n=l;
			while(n)
			{
				mi+=n/2+n%2;
				n/=2;
			}
			if(c<mi)
			cout<<"-1"<<endl;
			else
			{
			//	co;
				ll j=l-2;
				c-=(l-1);
				a[0]=1;
				ll i=2,k=1;
				ll s=l;
				while(c || s)
				{
					if(c>=j)
					{
					    a[k]=i;
						c-=j;
						i++;
						k++;
						s--;	
					}
					else
					{
					   c=0;
					   s--;
					   a[k]=i;
					   k++;
					   i++;
					}
				}
			rep(i,l)
			cout<<a[i]<<" ";
			cout<<endl;
		   }
		}
	}
}