#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);

const long double EPS = 1e-10;
const int MOD = 1000000007ll;
const int mod1 = 1000000009ll;
const int mod2 = 1100000009ll;
int INF = (int)1e9;
lli INFINF = (lli)1e18;
int debug = 0;
long double PI = acos(-1.0);

using namespace std;

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

template<class T1,class T2>ostream&operator<<(ostream& os,const pair<T1,T2>&p){os<<"["<<p.first<<","<<p.second<<"]";return os;}
template<class T>ostream&operator<<(ostream& os,const vector<T>&v){os << "[";bool first=true;for (T it:v){if (!first)os<<", ";first = false;os<<it;}os<<"]";return os;}
template<class T>ostream&operator<<(ostream& os,set<T>&v){os<<"[";bool first=true;for (T it:v){if(!first)os<<", ";first=false;os<<it;}os<<"]";return os;}
template<class T1,class T2>ostream&operator<<(ostream& os,map<T1,T2>&v){os<<"[";bool first=true;for(pair<T1,T2> it:v){if(!first)os<<", ";first=false;os<<"("<<it.F<<","<<it.S<<")";}os<<"]";return os;}
template<class T>void parr(T a[],int s,int e){cout<<"[";for(int i=s;i<e;i++)cout<<a[i]<<", ";cout<<a[e]<<"]\n";}

lli Q,len,c;
lli pre[100010];

lli sigma(lli x){
    return (x*(x+1))/2;
}

void dfs(lli N,lli C,lli offset){
    if(N<0)
        return;
    if(C == sigma(N-1)){
        for(int i=1;i<=N;i++)
            cout<<i+offset<<" ";
        return;
    }
    lli n = N - 1;
    C -= (N-1);
    //cout<<N<<" "<<C<<" "<<offset<<"\n";
    if(N==1){
        cout<<offset+1<<" ";
        return;
    }
    for(int i=1;i<n;i++){
        if(pre[i]+pre[n-1]<=C && C<=sigma(i-1)+sigma(n-2)){
            cout<<i+1+offset<<" ";
            dfs(i,pre[i],offset);
            dfs(n-i,C-pre[i],offset+i+1);
            return;
        }
    }
}

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

    pre[1] = 0;
    pre[2] = 1;
    pre[3] = 2;
    for(int i=4;i<=100000;i++){
        int x,y;
        int n = i - 1;
        x = n/2;
        if(n%2 == 0)
            y = n/2;
        else
            y = n/2 + 1;
        pre[i] = i - 1 + pre[x] + pre[y];
    }

    cin>>Q;
    while(Q--){
        cin>>len>>c;
        if(c>=pre[len] && c<=sigma(len-1)){
            dfs(len,c,0);
            cout<<"\n";
        }
        else{
            cout<<-1;
        }
    }

    return 0;
}