import std, core.bitop;
string[] _R;
void readM(T)(ref T x) { while (_R.empty) { _R = readln.chomp.split; } x = _R.front.to!T; _R.popFront; }
bool chmin(T)(ref T A, T B) { if (A > B) { A = B; return true; } else { return false; } }
bool chmax(T)(ref T A, T B) { if (A < B) { A = B; return true; } else { return false; } }
int lowerBound(T)(T[] A, T x) { int lo = -1, hi = cast(int)(A.length); while (hi - lo > 1) { int mid = lo + hi >> 1; (A[mid] < x ? lo : hi) = mid; } return hi; }
int upperBound(T)(T[] A, T x) { int lo = -1, hi = cast(int)(A.length); while (hi - lo > 1) { int mid = lo + hi >> 1; (A[mid] > x ? hi : lo) = mid; } return hi; }

void main() {
	int TE;
	TE.readM;
	foreach (_; 0 .. TE) {
		long N, X;
		N.readM;
		X.readM;
		if (N * (N + 1) / 2 > X) {
			writeln(-1);
			continue;
		}
		long lo = N, hi = (10 ^^ 9) * 2;
		while (hi - lo > 1) {
			long mid = lo + hi >> 1;
			(mid * (mid + 1) / 2 - (mid - N) * (mid - N + 1) / 2 <= X ? lo : hi) = mid;
		}
		long[] ans;
		foreach_reverse (i; lo - N + 1 .. lo + 1) {
			ans ~= i;
		}
		for (int i = 0; lo * (lo + 1) / 2 - (lo - N) * (lo - N + 1) / 2 + i < X; ++i) {
			++ans[i];
		}
		writefln("%(%s %)", ans);
	}
}