#include <bits/stdc++.h>

using namespace std;
// Generating permutation using Heap Algorithm
map <long,int> m;
int flag=0;
int val=0;
vector<long> lena_sort(vector<long> nums) {
    if (nums.size() <= 1) {
        return nums;
    }
    long pivot = nums[0];
    vector<long> less;
    vector<long> more;
    for (int i = 1; i < nums.size(); ++i) {
    	// Comparison
        if (nums[i] < pivot) {
            less.push_back(nums[i]);
            val++;
        }
        else {
            val++;
            more.push_back(nums[i]);
        }
    }
    vector<long> sorted_less(lena_sort(less));
    vector<long> sorted_more(lena_sort(more));
    vector<long> ans;
    for(int i=0;i<sorted_less.size();i++)
    ans.push_back(sorted_less[i]);
    
    ans.push_back(pivot);
        for(int i=0;i<sorted_more.size();i++)
    ans.push_back(sorted_more[i]);
    
    return ans;
}
void print(vector<long> a)
{
    flag=1;
    for(int i=0;i<a.size();i++)
    cout<<a[i]<<" ";
    cout<<"\n";
}
void heapPermutation(vector<long> a, int size, int n,int c)
{
    // if size becomes 1 then prints the obtained
    // permutation
    if (size == 1)
    {
         
        if(flag==0)
       {
            lena_sort(a);
            if(val==c)
           print(a);}
        val=0;
        return;
    }
 
    for (int i=0; i<size; i++)
    {
        heapPermutation(a,size-1,n,c);
 
        // if size is odd, swap first and last
        // element
        if (size%2==1)
            swap(a[0], a[size-1]);
 
        // If size is even, swap ith and last
        // element
        else
            swap(a[i], a[size-1]);
    }
}
int main(){
    int q;
    cin >> q;
    for(int a0 = 0; a0 < q; a0++){
        int len;
        int c;
        cin >> len >> c;
        // your code goes here
        vector<long> val(len);
        for(int i=0;i<len;i++)
        {val[i]=i+1;}

    heapPermutation(val,val.size(),val.size(),c);
    if(flag==0)
    cout<<"-1\n";
   flag=0;
     
    }
    return 0;
}