#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int c=0;
void lena_sort(vector<int> nums) {
    if (nums.size() <= 1) {
        return ;
    }
    int pivot = nums[0];
    vector<int>less;
    vector<int>more;
    for (int i = 1; i < nums.size(); ++i) {
    	// Comparison
        if (nums[i] < pivot) {
            less.push_back(nums[i]);
            c++;
        }
        else {
            more.push_back(nums[i]);
            c++;
        }
    }
    lena_sort(less);
    lena_sort(more);
    //int ans = sorted_less + pivot + sorted_more;
    
   // return ans;
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int t;
    int n,p;
    cin>>t;
    while(t--)
        {
        cin>>n>>p;
        if(p>(((n*(n-1))/2)))
            cout<<"-1";
        else
            {
            vector<int>v;
            for(int i=1;i<=n;i++)
                {
                v.push_back(i);
            }
            do{c=0;
              lena_sort(v); 
               if(c==p)
                   {
                   for(int i=0;i<v.size();i++)cout<<v[i]<<" ";
                   break;
               }
            }while(next_permutation(v.begin(),v.end()));
        }
        cout<<"\n";
    }
    
    return 0;
}