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

using ll = long long;

void solve() {

    int N; long long X;
    cin >> N >> X;

    if (N * (N + 1) / 2 > X) {
        cout << -1 << endl;
        return;
    }

    vector<ll> ans(N);
    for (int i = 0; i < N; i++) {
        ans[i] = i + 1;
        X -= i + 1;
    }

    ans.back() += X;

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


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