#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define FOR(i,a,b) for(i=a;i<b;++i)
#define FORD(i,a,b) for(i=a;i>=b;--i)
#define FORIT(it,a,b) for(it=a;it!=b;it++)
#define tpI(i,a,b,v) for(i=a;i<b;i++) { p(v[i]);} pn();
#define tpL(i,a,b,v) for(i=a;i<b;i++) { pl(v[i]);} pn();
#define ll long long
#define mp make_pair
#define pb push_back
#define MOD 1000000007
#define infi 1000000007
#define PI 3.14159265
#define s(x) cin>>x
#define fi first
#define se second
#define p(x) cout<<x<<" "
#define pn() cout<<endl
#define pc() cout<<"testing "<<endl
#define pm(m) cout<<m<<endl
#define pmv(m,x) cout<<m<<" "<<x<<endl
using namespace std;

int main(){
    
    ll q,i,j,k,len,c;
    s(q);
    while(q--)
    {
        s(len);
        s(c);
        ll check=(len*(len-1))/2;
        if(c>check)
        {
            p(-1);
            pn();
            continue;
        }
        
        queue<ll> Q;
        vector<ll> v;
        for(i=1;i<=len;i++)
            Q.push(i);
        
        ll temp=len-1;
        while(c>=temp && c>0)
        {
            ll f=Q.front();
            Q.pop();
            v.pb(f);
            c=c-temp;
            temp--;
        }
        
        if(c>0)
        {
            vector<ll> temp;
            ll z=Q.size()-c;
            for(i=1;i<=z;i++)
            {
                temp.pb(Q.front());
                Q.pop();
            }
            while(!Q.empty())
            {
                p(Q.front());
                Q.pop();
            }
            for(i=0;i<temp.size();i++)
                p(temp[i]);
            
        }
        if(c==0)
        {
            while(!Q.empty())
            {
                p(Q.front());
                Q.pop();
            }
        }
        for(i=v.size()-1;i>=0;i--)
            p(v[i]);
        pn();
    }
    
    return 0;
}