#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
void lena_sort(ll len, ll c){
  vector<ll> ans;  
  if(c==0){
    for(int i=1;i<=len;i++){
      cout<<i;      
    }cout<<endl; return;
  }else{
    for(int i=1;i<=len;i++){
       //ans.push_back(i);    
       cout<<i<<" "; 
    } cout<<endl;return; 
  }
    
     
}

int main(){
    int q;
    cin >> q;
    for(int a0 = 0; a0 < q; a0++){
        int len;
        int c;
        cin >> len >> c;
        // your code goes here
        if((c>(len*(len-1)/2))||
            (c<(len-1))){
          cout<<"-1"<<endl;  
        }else{
          lena_sort(len,c);  
        }
    }
    return 0;
}