#include <bits/stdc++.h>

using namespace std;

int main() {
    int T;
    cin >> T;
    while (T--) {
        long long N, X;
        cin >> N >> X;
        if (N * (N + 1) / 2 > X) {
            cout << -1 << endl;
            continue;
        }
        long long l = 1, r = (1LL << 60) / N;
        while (r - l > 1) {
            long long mid = l + (r - l) / 2;
            if ((mid + mid - N + 1) * N / 2 >= X) {
                r = mid;
            } else {
                l = mid;
            }
        }
        vector<long long> ans(N);
        for (int i = 0; i < N; i++) ans[i] = r - i;
        long long sum = (r + r - N + 1) * N / 2;
        long long rem = sum - X;
        for (int i = 0; i < sum - X; i++) {
            ans[N - 1 - i]--;
        }
        for (long long l: ans) cout << l << ' ';
        cout << endl;
    }
    return 0;
}