#include <bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define lp(i,a,n) for(int i=(a);i<=(int)(n);++i)
#define lpd(i,a,n) for(int i=(a);i>=(int)(n);--i)
#define mem(a,b) memset(a,b,sizeof a)
#define all(v) v.begin(),v.end()
#define println(a) cout <<(a) <<endl
#define sz(x) ((int)(x).size())
#define readi(x) scanf("%d",&x)
#define read2i(x,y) scanf("%d%d",&x,&y)
#define read3i(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define readll(x) scanf("%I64d",&x)
#define mod 1000000007
#define eps 1e-6
#define infi 1e9
#define infll 1e18
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef set<int> si;
typedef map<int,int> mii;

const int N = 100002;
int q,len,c;

int lenaSort(vi &nums) {
    if(sz(nums) <= 1) return 0;
    int pivot = nums[0];
    vi less;
    vi more;
    for (int i = 1; i < sz(nums); ++i) {
    	// Comparison
        if (nums[i] < pivot) {
            less.pb(nums[i]);
        }
        else {
            more.pb(nums[i]);
        }
    }

    return sz(nums)-1 + lenaSort(less) + lenaSort(more);
}

int main(){
    readi(q);
    while(q--){
        read2i(len,c);
        vi x;
        lp(i,1,len) x.pb(i);
        bool found = false;
        do{
            if(lenaSort(x) == c){
                found = true;
                for(int i : x) printf("%d ",i);
                break;
            }
        }while(next_permutation(all(x)));
        if(!found) printf("-1\n");
    }
}

//freopen("input.in","r",stdin);
//freopen("output.out","w",stdout);
//ios::sync_with_stdio(0);cin.tie(0);