#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
template<typename T> inline bool chmax(T &a, T b) {return ((a < b) ? (a = b, true) : (false));}
template<typename T> inline bool chmin(T &a, T b) {return ((a > b) ? (a = b, true) : (false));}
typedef long long ll;
typedef pair<ll,ll> P;



int main() {
    ll t;
    cin >> t;
    vector<ll> n(t), x(t);
    rep(i,t) cin >> n[i] >> x[i];

    rep(i,t) {
        ll sum = (1+n[i]-1)*(n[i]-1)/2;
        if(x[i] - sum > n[i]-1) {
            for(ll j = 1; j <= n[i]-1; j++) {
                cout << j << " ";
            }
            cout << x[i] - sum << endl;
        }
        else {
            cout << -1 << endl;
        }
    }



    return 0;
}