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

int main() {
	int TE;
	cin >> TE;
	while (TE--) {
		long N, X;
		cin >> N >> X;
		if (N * (N + 1) / 2 > X) {
			cout << "-1\n";
			continue;
		}
		long lo = N, hi = 4e9;
		while (hi - lo > 1) {
			long mid = lo + hi >> 1;
			(mid * (mid + 1) / 2 - (mid - N) * (mid - N + 1) / 2 <= X ? lo : hi) = mid;
		}
		vector<long> ans;
		for (long i = lo; i > lo - N; --i) {
			ans.push_back(i);
		}
		for (long i = 0; lo * (lo + 1) / 2 - (lo - N) * (lo - N + 1) / 2 + i != X; ++i) {
			++ans[i % N];
		}
		for (int i = 0; i < N; ++i) {
			cout << ans[i] << " \n"[i == N - 1];
		}
	}
}