#include <bits/stdc++.h>

using namespace std;

#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define fff ff
#define sss ss.ff
#define ttt ss.ss
#define INF 1000000000


#define FASTIO std::ios::sync_with_stdio(false)

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef unsigned int ui;

int min(int a, int b) {if (a < b) return a; return b;};
int max(int a, int b) {if (a > b) return a; return b;};

/*-----------------END TEMPLATE-----------------*/

int comparison = 0;
int limit = 6;

vi lena_sort(vi nums) {
    if (nums.size() <= 1 || limit < comparison) return nums;

    int pivot = nums[0];
    vi less;
    vi more;
    bool broke = false;
    int index = -1;
    for (int i = 1; i < nums.size(); i++) {
        comparison++;
        if (nums[i] > pivot) less.pb(nums[i]);
        else more.pb(nums[i]);

        if (comparison >= limit) {
            broke = true;
            index = i+1;
            break;
        }
    }

    for (int i = index; i < nums.size(); i++) more.pb(nums[i]);
    if (!broke) {
        less = lena_sort(less);
        more = lena_sort(more);
    }
    vi ans;
    int l = less.size(), m = more.size();
    for (int i = 0; i < l; i++) ans.pb(less[i]);
        ans.pb(pivot);
    for (int i = 0; i < m; i++) ans.pb(more[i]);

        return ans;
}

int main() {

    int n;
    cin >> n;
    int a, b;

    while (n--) {
        cin >> a >> b;
        vi c;
        for (int i = 1; i <= a; i++) c.pb(i);
        comparison = 0;
        limit = b;
        c = lena_sort(c);
        if (comparison != limit) cout << -1 << endl;
        else {
            cout << c[0];
            for (int i = 1; i < a; i++) cout << ' ' << c[i];
            cout << endl;
        }

    }
    
}