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

using ll = long long;


void solve() {
    ll N, X; cin >> N >> X;
    if (N * (N + 1) / 2 > X) {
        cout << -1 << endl;
        return;
    }    

    vector<ll> ans(N);
    ll add = (X - N * (N + 1) / 2) / N;
    ll mod = (X - N * (N + 1) / 2) % N;
    for (int i = 0; i < N; i++) {
        ans[i] = N - i + add + (mod > 0);
        if (mod > 0) mod--;
    }

    for (int i = 0; i < N; i++) {
        cout << ans[i] << " \n"[i == N - 1];
    }
}

int main() {
    int T; cin >> T;
    while (T--) {
        solve();
    }
}