#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <numeric>

using namespace std;

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<long> vl;
typedef long long ll;
typedef pair<long long, long long> llll;
typedef vector<long long> vll;
#define matrix(a) vector< vector<a> >
#define sz(a) int((a).size()) 
#define last(a) a[sz(a)-1]
#define ite(v) v::iterator
#define lop(i,a,b) for (int i=a; i<=b; i++)
#define vlop(i,v) lop(i,0,sz(v)-1)
#define vlop1(i,v) lop(i,1,sz(v)-1)
#define rlop(i,a,b) for (int i=b; i>=a; i--)
#define vrlop(i,v) rlop(i,0,sz(v)-1)
#define vrlop1(i,v) rlop(i,1,sz(v)-1)
#define printv(i,v) vlop(i,v)cout<<v[i]<<" "
#define all(s) (s).begin(),(s).end()
#define isthere(c,x) ((c).find(x) != (c).end()) 
#define cisthere(c,x) (find(all(c),x) != (c).end())
#define pb push_back
#define fill(s,v) memset(s,v,sizeof(s))
#define enter cout<<endl
const int inf=100000;

void bestify(vi& seq,int l, int u,int s, int b){
    if(u-l+1<=1){
        seq[l]=s;
        return;
    }
    if(u-l+1==2){
        seq[l]=s;
        seq[u]=b;
        return;
    }
    int mid=(l+u)/2;
    int midn=(s+b)/2;
    seq[l]=midn;
    bestify(seq,l+1,mid,s,midn-1);
    bestify(seq,mid+1,u,midn+1,b);
    return;
}

int main(){
    int q;
    cin >> q;
    vi best(inf+1,0);
    best[2]=1;
    lop(i,3,inf)best[i]=i-1+best[i/2]+best[(i-1)/2];
    for(int a0 = 0; a0 < q; a0++){
        ll l;
        ll c;
        cin >> l >> c;
        if(c>(l-1)*l/2)cout<<-1<<endl;
        else if(c<best[l])cout<<-1<<endl;
        else{
            int good=-1;
            lop(i,0,l){
                ll t=(1LL*i+l-1)*(l-i*1LL)/2+best[i];
                /*cout<<t<<" ";*/
                if(t==c){
                    good=i;
                    break;
                }
            }
            if(good==-1)cout<<-1<<endl;
            else{
                vi seq(l+1);
                lop(i,1,l)seq[i]=i;
                bestify(seq,l-good+1,l,l-good+1,l);
                lop(i,1,l)cout<<seq[i]<<" ";
                enter;
            }
        }
    }
    return 0;
}