#include <bits/stdc++.h>

using namespace std;
long long a,s,d[100002],f,g,h,j,k,l,i,n,m,minct[100002];
void ddi(long long i1,long long i2,long long m){
    long long k;
   //cout<<">"<<i1<<" "<<i2<<" "<<m<<endl;
   long long l=i2-i1;
    if(l==0) {cout<<i1<<" ";return;}
    if(l<0) return;
    
   long long f=-1,g=(l+1)/2+1;
   m-=l;
    while(g-f>1){
       k=(f+g)/2;
       long long mn=minct[k]+minct[l-k],mx=k*(k-1)/2+(l-k)*(l-k-1)/2;
       if(mx>=m && mn<=m) {
           cout<<i1+k<<" ";
           //cout<<">>"<<i1<<" "<<i2<<" "<<k<<" "<<m<<"   "<<mn<<" "<<mx<<"   "<<l<<endl;
           long long m1=minct[k],m2;
           if(m-m1>(l-k)*(l-k-1)/2) {m2=(l-k)*(l-k-1)/2;m1=m-m2;}
           else m2=m-m1;
           ddi(i1,i1+k-1,m1);
           ddi(i1+k+1,i2,m2);
           break;
       }
       //cout<<">("<<mx<<" "<<mn<<" "<<m<<") "<<k<<" "<<f<<" "<<g<<" "<<i1<<" "<<i2<<endl;
       if(mx<m) g=k; else f=k;
   }
    //cout<<"*"<<l<<" "<<i1<<" "<<i2<<" "<<f<<" "<<g<<" "<<m<<"*"<<endl;
   return;
}
int main(){
    int q;
    cin >> q;
    minct[1]=0;
    minct[2]=1;
    for(i=3;i<=100000;i++){
        minct[i]=i-1+minct[(i-1)/2]+minct[i-1-(i-1)/2];
    }
   
    for(int Q=0;Q<q;Q++){
        cin>>n>>m;
        //cout<<minct[n]<<" "<<n*(n-1)/2<<" "<<n;
        if(minct[n]>m || m>n*(n-1)/2) {cout<<-1<<endl;continue;}
        ddi(1,n,m);
        cout<<endl;
    }
    return 0;
}