#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#include <atcoder/all>
using namespace atcoder;
using mint1 = modint1000000007;
using mint2 = modint998244353;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
ld pi=3.141592653589793;
const int inf=2e9;
const ll linf=2e18;
const ld eps=1e-14;
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl

int main() {
    ll t;
    cin >> t;
    while(t--) {
        ll n,x;
        cin >> n >> x;
        ll sum=0;
        vector<ll> ans;
        bool p=true;
        for(int i=1; i<=n-1; i++) {
            ans.push_back(i);
            sum+=i;
            if(sum>=x) {
                cout << -1 << endl;
                p=false;
                break;
            }
        }
        if(p) {
            if(x-sum>=n) {
                ans.push_back(x-sum);
            }else {
                p=false;
                cout << -1 << endl;
            }
        }
        if(p) {
            for(int i=0; i<n; i++) {
                cout << ans[i] << " ";
            }
            cout << endl;
        }
    }
}