#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


vector<int> lena_sort(vector<int>& nums, int *c) {
    if (nums.size() == 1 || *c < 0 || nums.size() == 0) {
        return nums;
    }
    int pivot = nums[nums.size() - 2];
    vector<int> less;
    vector<int> more;
    for (int i = 0; i < nums.size() && *c; ++i ) {
        if (nums[i] < pivot) {
            (*c)--;
            less.push_back(nums[i]);
        }
        else if(nums[i] > pivot){
            (*c)--;
            more.push_back(nums[i]);
        }
    }
    vector<int> sorted_less;
    vector<int> sorted_more;
    sorted_less = lena_sort(less, c);
    sorted_more = lena_sort(more, c);
    vector<int> ans;
    ans.push_back(pivot);
    for (vector<int>::iterator it = sorted_less.begin() ; it != sorted_less.end(); ++it){
        ans.push_back(*it);
    }
    for (vector<int>::iterator it = sorted_more.begin() ; it != sorted_more.end(); ++it){
        ans.push_back(*it);
    }
    return ans;
}


int main() {
    int q, len, c;
    cin >> q;
    while(q--){
        cin >> len >> c;
        if((len * (len - 1)) / 2 >= c){
            if((len * (len - 1)) / 2 == c){
                while(len--){
                    cout << len + 1<< " ";
                }
             }else{
                vector<int> arr;
                vector<int> arrPrint;
                for(int i = 0; i < len; i++){
                     arr.push_back(i + 1);
                }
                arrPrint = lena_sort(arr, &c);
                for (vector<int>::iterator it = arrPrint.begin() ; it != arrPrint.end(); ++it){
                    cout << *it << " ";
                }
            }
        }else{
            cout << -1;
        }
        cout << "\n";
    }
    return 0;
}