#include <bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
const ll mod = 1000000007;
//const ll mod = 998244353;
ll t, n[100009], x[100009];
int main() {
	cin >> t;
	for (int i = 1; i <= t; i++)cin >> n[i] >> x[i];
	for (int i = 1; i <= t; i++) {
		if (((n[i] * (n[i] + 1)) / 2) > x[i]) {
			cout << "-1" << endl;
			continue;
		}
		ll res = x[i] - (n[i] * (n[i] + 1)) / 2;
		ll mo = res % n[i];
		ll div = res / n[i];
		ll cnt = 0;
		for (int j = n[i]; j >= 1; j--) {
			cnt++;
			ll ans = j;
			if (cnt <= mo)ans++;
			ans += div;
			cout << ans << " ";
		}
		cout << endl;
	}
}