#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint1000000007;
#define rep(i, n) for(ll i = 0; i < n; i++)

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    
    ll t; cin >> t;
    while(t--) {
        ll n, x; cin >> n >> x;
        if( x < (1+n)*n/2 ) cout << -1 << endl;
        else {
            vector<ll> ans(n);
            rep(i,n) ans[i] = n-i;
            x -= (1+n)*n/2;
            rep(i,n) {
                if( i >= n-1-x%n ) ans[i] += x/n + (x%n == 0 ? 0 : 1);
                else ans[i] += x/n;
            }
            rep(i,n) cout << ans[i] << " ";
            cout << endl;
        }
    }
    
    return 0;
}