#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		long long n; cin >> n;
		long long x; cin >> x;
		{
			long long mn = (1LL + n)*(n) / 2;
			if (mn > x) {
				cout << -1 << endl;
				continue;
			}
		}
		vector<long long>ans;
		rep(i, n) {
			int j = n - i;
			long long ng = -1;
			long long ok = (x + n) / n + (n + 1) / 2 + 1;
			while (1 < abs(ok - ng)) {
				long long mid = (ng + ok) / 2;
				auto check = [&]() {
					long long val = (mid + mid - (j - 1))*j / 2;
					return val >= x;
				};
				if (check()) ok = mid;
				else ng = mid;
			}
			x -= ok;
			ans.push_back(ok);
		}
		rep(i, n)cout << ans[i] << " ";
		cout << endl;
		long long ng = -1;

	}
	return 0;
}