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


int main() {
    int q;
    cin >> q;
    for (int i=0; i<q; ++i) {
        long len, comp;
        cin >> len >> comp;
        if (len == 1) {
            cout << (comp == 0? "1" : "-1");
        } else if (comp < len - 1) {
            cerr << "Too few comparisons";
            cout << "-1";
        } else if (len == 2) {
            cout << (comp == 1? "1 2" : "-1");
        } else if (len == 3) {
            if (comp == 2) {
                cout << "2 1 3";
            } else if (comp == 3) {
                cout << "1 2 3";
            } else {
                cout << "-1";
            }
        }
        else if (comp == ((len*(len - 1)) >> 1)) {
            cerr << "all ascending";
            for (int j=1; j<=len; ++j) {
                cout << j << " ";
            }
        } else {
            cout << "-1";
        }
        
        cout << endl;
    }
    return 0;
}