#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define int ll
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<string> vs;
#define pb push_back
#define mp make_pair
#define ft first
#define sc second
#define in insert
#define rc(s) return cout << s,0
const ll mod=1e9+7;
const int N=100005;
#define M_PI 3.14159265358979323846
#define INF LLONG_MAX
#define sz(x) ((int)(x.size()))
#define endl '\n'
#define map unordered_map
/*----------------------------*/
vi returnPermutation(int n,int k){
    k--;
    vi ans;
    ans.pb(1);
    int l = 1, r = pow(2,min(n-1,(ll)60)),mid,nxt = 1;
    string bin="";
    while(bin.size()!=n-1){
        bin+=k%2+'0';
        k/=2;
    }
    //cout<<bin<<endl;
    reverse(bin.begin(),bin.end());
    for(int j = 0; j < bin.size();j++){
        if(bin[j]=='0') {
            nxt++;
            ans.pb(nxt);
        } else {
            for(int i = 0; i < ans.size(); i++) {
                if(ans[i] == nxt) {
                    nxt++;
                    ans.insert(ans.begin()+i,nxt);
                    break;
                }
            }
        }
    }
    return ans;
}
/*----------------------------*/
int32_t main() {
    //freopen("sol.in","r",stdin);
    //freopen("sol.out","w",stdout);
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int t,n,k;
    cin>>t;
    while(t--){
        cin>>n>>k;
        if(pow(2,min(n-1,(ll)60)) < k) {
            cout<<-1<<endl;
        } else {
            vi v = returnPermutation(n,k);
            for(int i = 0; i < v.size(); i++) {
                cout<<v[i]<<' ';
            }
            cout<<endl;
        }
    }
    //THIS IS IS THE END
}
