/*
 Author - Meet Shah
DAIICT
_     . .      _ 
  \_(  -  )_/

*/
#include<bits/stdc++.h>

#define LOCAL 0

#define lli long long int
#define llu unsigned long long int
#define ld long double
#define all(v) v.begin(),v.end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define si(n) scanf("%d",&n)
#define slli(n) scanf("%lld",&n);
#define ss(n) scanf("%s",n);


#define sz(c) (int)(c).size()
#define forn(i, a, b) for(int i = a; i < b; i++)
typedef std::vector<int> vi;

/*



typedef long long ll;
typedef std::vector<bool> vb;
typedef std::vector<string> vs;
typedef std::vector<double> vd;
typedef std::vector<long long> vll;
typedef std::vector<std::vector<int> > vvi;
typedef vector<vvi> vvvi;
typedef vector<vll> vvll;
typedef std::vector<std::pair<int, int> > vpi;
typedef vector<vpi> vvpi;
typedef std::pair<int, int> pi;
typedef std::pair<ll, ll> pll;
typedef std::vector<pll> vpll;
*/ const long double EPS = 1e-10;
const lli MOD = 1000000007ll;
const lli mod1 = 1000000009ll;
const lli mod2 = 1100000009ll;
int INF = (int)1e9;
lli INFINF = (lli)1e18;
int debug = 0;

using namespace std;

lli bit_count(lli _x){lli _ret=0;while(_x){if(_x%2==1)_ret++;_x/=2;}return _ret;}
lli bit(lli _mask,lli _i){return (_mask&(1<<_i))==0?0:1;}
lli powermod(lli _a,lli _b,lli _m=MOD){lli _r=1;while(_b){if(_b%2==1)_r=(_r*_a)%_m;_b/=2;_a=(_a*_a)%_m;}return _r;}
lli add(lli a,lli b,lli m=MOD){lli x=a+b;while(x>=m)x-=m;return x;}
lli sub(lli a,lli b,lli m=MOD){lli x=a-b;while(x<0)x+=m;return x;}
lli mul(lli a,lli b,lli m=MOD){lli x=a*1ll*b;x%=m;if(x<m)x+=m;return x;}

int main()
{
if(LOCAL){
    freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    debug = 1;
}
    srand (time(NULL));


{
    lli q,n,p;
    cin>>q;
    while(q--){
        lli maxi;
        slli(n);slli(p);
        maxi = (n*(n-1)/2);
        if(p>maxi){
            cout<<"-1"<<endl;
        }
        else{
            lli arr[n];
            for(int i=0;i<n;i++){
                arr[i] = (i+1);
            }
            //int y=0;
            while(p>0){
                if(p>(n+1)){
                    swap(arr[0],arr[n-1]);
                    p-=(n);
                    
                }
                else if(p>n){
                    swap(arr[0],arr[n-2]);
                    p-=(n-1);
                    
                }
                else{
                    swap(arr[n-p-1],arr[n-2]);
                   p = 0;
                }
            }
            for(int i=0;i<n;i++){
            cout<<arr[i]<<" ";
            }
            cout<<endl;
        }
        
    }
}

    return 0;

}