#include <bits/stdc++.h>

using namespace std;
int counti =0;
vector<int> lena_sort(vector<int> 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]);
            counti++;
        }
        else {
        	counti++;
            more.push_back(nums[i]);
        }
    }
    lena_sort(less);
    lena_sort(more);
    //int ans = sorted_less + pivot + sorted_more;
    return nums;
    //r/eturn ans;
}
int main(){
    int q;
    cin >> q;
    for(int a0 = 0; a0 < q; a0++){
        int len;
        int c;
        cin >> len >> c;
      vector<int > vec(len);
      for(int i=0;i<len;i++) vec[i]= i+1;
      vec = lena_sort(vec);
     // cout<<vec[1];
     if(counti>=c)
     {
     	for(int i=len-1;i>=0;i--)
     	{
     		cout<<vec[i]<<" ";
		 }
		 cout<<endl;
	 }
	 else 
	 {
	 	cout<<"-1\n";
	 }
      //cout<<counti<<endl;
    }
    return 0;
}