//By Don4ick
#include <bits/stdc++.h>

using namespace std;

int q, n, res;

void calc(vector < int > a)
{
	if ((int)a.size() <= 1)
		return;
	int x = a[0];
	vector < int> more, les;
	for (int i = 1; i < (int)a.size(); i++)
	{
		res++;
		if (a[i] > x)
			more.push_back(a[i]);
		else
			les.push_back(a[i]);
	}	
	calc(more), calc(les);
}

void solve()
{
	int c;
	cin >> n >> c;
	vector < int > a;
	int cnt = 1;
	for (int i = 1; i <= n; i++)
	{
		cnt *= i;
		a.push_back(i);
	}
	for (int i = 1; i <= cnt; i++)
	{
		res = 0;
		calc(a);
		if (res == c)
		{
			for (int i = 0; i < (int)a.size(); i++)
				cout << a[i] << ' ';
			cout << endl;
			return;
		}
		next_permutation(a.begin(), a.end());
	}                    
	cout << -1 << endl;
}

int main()
{
//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);
	cin >> q;
	while(q--)
		solve();
	return 0;
}