#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>

#define pb push_back

using namespace std;

int ans;

vector<int> lena_sort(vector<int> nums) {
    if (nums.size() <= 1) {
        return nums;
    }
    int pivot = nums[0];
    vector<int> less;
    vector<int> more;
    //for (int i = 0; i < nums.size(); ++i) cout<<nums[i]<<" ";
    //cout << "\n";
    for (int i = 1; i < nums.size(); ++i) {
        // Comparison
        ans++;
        if (nums[i] < pivot) {
            less.push_back(nums[i]);
        }
        else {
            more.push_back(nums[i]);
        }
    }
    vector<int> sorted_less = lena_sort(less);
    vector<int> sorted_more = lena_sort(more);
    vector<int> ans = sorted_less;
    ans.push_back(pivot);
    for (auto it : sorted_more) ans.push_back(it);
    return ans;
}

vector<int> F(int n, int c) {
    vector<int> a;        
    for (int i = 1; i <= n; i++) a.push_back(i);
    do {
        ans=0;
        lena_sort(a);
        if (ans==c)return a;   
    } while(next_permutation(a.begin(),a.end()));
    return {-1};
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    int q;
    cin >> q;
    while (q--) {
        int n, c;
        cin >> n >> c;
        vector<int> ans = F(n, c);
        for (int i = 0; i < ans.size(); i++) cout << ans[i] << " "; cout << "\n";
    }
    return 0;
}