#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;
        if((2*x-n*n+3*n)%(2*n)!=0) {
            cout << -1 << endl;
        }else {
            vector<ll> ans;
            for(ll i=0; i<n; i++) {
                ans.push_back((2*x-n*n+3*n)/(2*n)+i-1);
            }
            reverse(ans.begin(),ans.end());
            for(ll i=0; i<n; i++) {
                cout << ans[i] << " ";
            }
            cout << endl;
        }
    }
}