#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
using namespace std;

#define fi first
#define se second
typedef long long LL;
typedef long double LD;

LL Q,len,c,T[100010];

vector<int> get_array(LL first, LL N, LL tot){
    tot-=(N-1);
    vector<int> ans;
    ans.clear();
    if (N==0) return ans;

    vector<int> left,right;
    left.clear(),right.clear();
    LL l1,r1,l2,r2;
    for (int i=0; i<N; i++)
        if (T[N-i-1]+T[i]<=tot && tot<=i*(i-1)/2+(N-i-1)*(N-i-2)/2){
            l1=T[i],r1=i*(i-1)/2;
            l2=tot-(N-i-1)*(N-i-2)/2,r2=tot-T[N-i-1];
            if (l1>l2) swap(l1,l2),swap(r1,r2);

            if (r1<l2) continue;
            left=get_array(first,i,l2);
            right=get_array(first+i+1,N-i-1,tot-l2);
            ans.push_back(first+i);
            ans.insert(ans.end(),left.begin(),left.end());
            ans.insert(ans.end(),right.begin(),right.end());
            break;
        }
    return ans;
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    int i;
    T[1]=0;
    for (i=2; i<=100000; i++)
        T[i]=i-1+T[(i-1)/2]+T[i/2];

    cin >> Q;
    while (Q--){
        cin >> len >> c;
        if (c>len*(len-1)/2 || c<T[len]){
            cout << -1 << "\n";
            continue;
        }

        vector<int> ans=get_array(1,len,c);
        if (ans.size()==0) cout << -1 << "\n";
        else{
        for (i=0; i<ans.size(); i++) cout << ans[i] << " ";
        cout << "\n";
        }
    }
    return 0;
}