#include <bits/stdc++.h>

using namespace std;
vector<int> lena(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]);
        }
        else {
            more.push_back(nums[i]);
        }
    }
    lena(less);
    lena(more);
    nums.assign(more.begin(), more.end());
    nums.push_back(pivot);
    nums.insert(nums.end(), less.begin(), less.end());
    return nums;
    }


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 - 1 || c > len * len)
            cout << -1 << endl;
        else {
            vector<int> v(len);
            for(int i = 0; i < len; i++){
                v[i] = 1 + i;
            }
            vector<int> res = lena(v);
            for(auto i : res){
                cout << i << ' ';
            }
            cout << endl;
        }
    }
    return 0;
}