#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long kaiwa(long long x) {
    if (x%2 == 0) {
        return x*(x/2) + (x/2);
    } else {
        return x*((x+1)/2);
    }
} 

void solve() {
    ll T;
    cin >> T;

    for (ll tt = 0; tt < T; ++tt) {
        ll n,x;
        cin >> n >> x;


        if (x<kaiwa(n)) {
            cout << -1 << endl;
            continue;
        }

        ll kai = kaiwa(n);
        ll Y = (x-kai)/n;
        ll Ymd = (x-kai)%n;

        vector<ll> ans;
        for (ll i = n; i >= 1; --i) {
            ans.push_back(i);
        }

        for (ll i = 0; i < ans.size(); ++i) {
            ll tmp = ans[i];
            if (Ymd > i) ++tmp;
            cout << tmp+Y << ' ';
        }
        cout << endl;


    }
}

int main() {
    solve();
    return 0;
}