#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

void best(int n, int s){
    if (n==1){
        cout<<s<<" ";
    }
    else if (n==2){
        cout<<s<<" "<<s+1<<" ";
    }
    else if (n>2){
        if (n%2==1){
            int med=s+(n-n%2)/2;
            cout<<med<<" ";
            int n1=(n-n%2)/2;
            int n2=(n-n%2)/2;
            int s1=s;
            int s2=med+1;
            best(n1, s1);
            best(n2, s2);
        }
        else {
            int med=s+n/2;
            cout<<med<<" ";
            int n1=(n/2);
            int n2=(n/2)-1;
            int s1=s;
            int s2=med+1;
            best(n1, s1);
            best(n2, s2);
        }
    }
}

void gen(int n, int c, int s, vector<int> &B){
    if (B[n]==c){
        best(n,s);
    }
    else {
        c-=(n-1);
        int a=n-1;
        int b=0;
        while (B[a]+B[b]>c){
            a--;
            b++;
        }
        int sa=s;
        int sb=s+a+1;
        //cout<<"Dividing "<<n<<" into "<<a<<" and "<<b<<endl;
        cout<<s+a<<" ";
        gen(a,c-B[b],sa,B);
        best(b,sb);
    }
}

int main() {
    int q;
    cin>>q;
    vector<int> B(100000+1);
    B[0]=0;
    B[1]=0;
    for (int h=2; h<100000+1; h++){
        int lowh=((h-1)-(h-1)%2)/2;
        int highh=((h-1)+(h-1)%2)/2;
        B[h]=h-1+B[lowh]+B[highh];
    }
    for (int h=0; h<q; h++){
        long long len;
        int c;
        cin>>len>>c;
        long long worst=len*(len-1)/2;
        int best=B[len];
        if (c>worst || c<best){
            //cout<<c<<" "<<worst<<" "<<best<<endl;
            cout<<-1<<endl;
        }
        else {
            int n=len;
            gen(n, c, 1, B);
            cout<<endl;
        }
    }
    return 0;
}