// 

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define rep(i, n) for (int i=0; i<(int)(n); ++(i))
#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))
#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))
#define rep3r(i, m, n) for (int i=(int)(n)-1; (i)>=(int)(m); --(i))
#define all(x) (x).begin(), (x).end()

const int INF = (int)(1e9);

int main() {
	int t0;
	cin >> t0;
	rep(i0, t0) {
		int n;
		ll x;
		cin >> n >> x;
		if (n == 1) cout << x << endl;
		else {
			vector<ll> a(n);
			iota(a.begin(), a.end()-1, 1LL);
			a[n-1] = x - (ll)n * (n-1) / 2;
			if (a[n-1] <= a[n-2]) cout << -1 << endl;
			else rep(i, n) cout << a[i] << (i<n-1?' ':'\n');
		}
	}
	return 0;
}