#include <iostream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <utility>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <cstdlib>
#include <iterator>
#include <algorithm>
#include <streambuf>
/// C Header Files
#include <cstdio>
#include <cctype>
#include <cmath>
#include <fstream>
#include <math.h>
#include <ctime>
#include <cstring>

using namespace std;

typedef pair<int, int> pii;
typedef pair<pii, pii> piii;

#define SET(a)                memset( a, -1,    sizeof a )
#define CLR(a)                memset( a,  0,    sizeof a )
#define MEM(a,val)            memset( a,  val,  sizeof(a) )
#define pb                    push_back
#define all(x)                (x).begin(), (x).end()
#define sz(a)                 int((a).size())
#define ff                    first
#define ss                    second
#define mp                    make_pair
#define nl                    "\n"

vector<long long> ar;
vector<int> ans;
int main() {

	int q;
	cin >> q;
	for (int i = 0; i < q; i++) {
		int len, ci;
		ans.clear();
		cin >> len >> ci;
		if(len == 1)
		{
			if(ci == 0)
				cout<<"1"<<nl;
			else
				cout<<"-1"<<nl;
			continue;
		}
		int a, b, c;
		c = (len - 1) * (len - 1) - len + 1 - 2 * (ci - len + 1);
		b = -2 * (len - 1);
		a = 2;
		int x1 = (double)(-b + sqrt(b * b - 4 * a * c)) / (double)(2 * a);
		int x2 = (double)(-b - sqrt(b * b - 4 * a * c)) / (double)(2 * a);
//		cout<<x2<<" "<<x1<<endl;
		if ((a * x1*x1 + b * x1 + c) == 0 && x1 > 0) {
			for (int i = len - x1; i <= len; i++)
				ans.pb(i);
			for (int i = 1; i < len - x1; i++)
				ans.pb(i);
		} else if ((a * x2*x2 + b * x2 + c) == 0 && x2 >= 0) {
			for (int i = len - x2; i <= len; i++)
				ans.pb(i);
			for (int i = 1; i < len - x2; i++)
				ans.pb(i);
		} else
			printf("-1\n");

		if (ans.size()) {
			for (int i = 0; i < ans.size(); i++)
				printf("%d ", ans[i]);
			printf("\n");
		}

	}
}