#include <vector>
#include <iostream>

using namespace std;

vector<int> lena_sort(vector<int> nums, int& comp)
{
    if (nums.size() < 2) {
        return nums;
    }

    vector<int> less;
    vector<int> more;
    int pivot = nums[0];

    for (int i = 1; i < nums.size(); ++i) {
        comp++;
        if (nums[i] < pivot) {
            less.push_back(nums[i]);
        } else {
            more.push_back(nums[i]);
        }
    }

    vector<int> sorted_less = lena_sort(less, comp);
    vector<int> sorted_more = lena_sort(more, comp);

    vector<int> res;
    for (auto i: sorted_less) res.push_back(i);
    res.push_back(pivot);
    for (auto i: sorted_more) res.push_back(i);
    return res;
}

int pick(int num, int& comp)
{
    if (num < comp) {
        return num;
    } else {
        return num + 1;
    }
}

int main()
{
    // int comp = 0;
    // vector<int> nums({1, 2, 3, 5});
    // vector<int> nums({2, 1, 3, 4, 5, 6, 7, 8, 9, 10});
    // vector<int> nums_sorted = lena_sort(nums, comp);
    // cout << comp;

    int q;
    cin >> q;

    for (int a0 = 0; a0 < q; a0++) {
        int len, c;
        bool found = false;
        cin >> len >> c;

        vector<int> nums(len);
        for (int i = 1; i <= len; i++) nums[i-1] = i;

        for (int i = 0; i < len; i++) {
            int comp = 0;
            swap(nums[0], nums[i]);
            lena_sort(nums, comp);
            if (comp == c) {
                found = true;
                break;
            }
            swap(nums[0], nums[i]);
        }

        if (found) {
           for (auto n: nums) cout << n << ' ';
        } else {
            cout << -1;
        }

        cout << endl;
    }

    return 0;
}