#include <bits/stdc++.h>

using namespace std;

int aa=0;


vector <int> sorted_more;

vector <int> lena_sort(vector <int> nums) 
{
	if(nums.size()==0)
	 return  nums;
	 
    if (nums.size() == 1) {
        return nums;
    }
    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]);
        }
        else {
            more.push_back(nums[i]);
        }
        aa++;
    }
    
    vector  <int> ans;
    
    
    vector <int> sorted_less = lena_sort(less);
	
	for(int i=0;i<sorted_less.size();i++)
     ans.push_back(sorted_less[i]);
     
    ans.push_back(pivot);
    
    vector <int> sorted_more = lena_sort(more);
    for(int i=0;i<sorted_more.size();i++)
     ans.push_back(sorted_more[i]);
    
    //ans = sorted_less + pivot + sorted_more;
    return ans;
}
int main()
{
	int C,Q;
	scanf("%d",&Q);
	while(Q--)
	{
		int N;
		scanf("%d %d",&N,&C);
        if(C>=N*N)
            {
            cout  << "-1\n";
            continue;
        }
		vector <int> v;
		for(int i=1;i<=N;i++)
		 v.push_back(i);
		int fg=0;
		do
		{
			aa=0;
		    lena_sort(v);
		    //cout << "here" << endl;
		    if(aa==C)
		    {
		    	for(int  i=0;i<v.size();i++)
		    	 cout << v[i] << " ";
		    	cout  << endl;
		    	fg=1;
			}
			if(fg==1)
			 break;
		}
		while(next_permutation(v.begin(),v.end()));
		if(fg==0)
		{
			cout << "-1\n";
		}
	}
	return 0;
}