#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>
using namespace std;
typedef vector <int> vi;
#define INF 1000000000

int main() {
  // freopen("in.in", "r", stdin);
  int q, len, c; scanf("%d",&q);
  for (int i = 0; i < q; ++i){
    scanf("%d %d",&len,&c);
    if(c <= len*len){
      vi permutation(len+1);
      iota(permutation.begin()+1, permutation.begin() + len + 1, 1);
      // printf("------\n");
      // for (int i = 1; i < len+1; ++i){
      //   cout<<permutation[i]<<",";
      // }
      // printf("\n********\n");

      for(int i=0, j=2;i<c;i++,j++){
        swap(permutation[j],permutation[j/2]);
        if(j == len){
          j=2;
        }
      }
      for (int i = 1; i < len+1; ++i) printf("%d ",permutation[i]);
      printf("\n");
    }else{
      printf("-1\n");
    }
  }
  return 0;
}