//(・ω・)
#include <stdio.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, atoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip> //setprecision
#include <limits>
#include <sstream> //istringstream
#include <stdlib.h>
#include <list>
#include <iterator>//std::advance()
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;

#define SZ(x) ((int)(x).size());
#define vec vector
template <class T>
using v = vector<T>;
template <class T>
using vv = v< v<T> >;
template <class T>
using vvv = v< vv<T> >;
#define el '\n'
#define vl v<ll>
#define vvl vv<ll>
#define pl pair<ll, ll>
#define repab(i, a, b) for(ll i = a; i < (ll)(b); ++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define rep1(i, n) for(ll i = 1; i <= (ll)(n); ++i)
#define rrep(i, n) for(ll i = ((ll)(n) - 1); i >= 0; --i)
#define rrep1(i, n) for(ll i = ((ll)(n)); i > 0; --i)
#define YN(x) cout << ((x) ? "YES\n" : "NO\n");
#define Yn(x) cout << ((x) ? "Yes\n" : "No\n");
#define yn(x) cout << ((x) ? "yes\n" : "no\n");
#define COUT(x) cout << (x) << el;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;

ll gcd(ll a, ll b){return b ? gcd(b, a % b) : a;}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main(){
    ll t;
    cin >> t;
    rep(i, t){
        ll n,x;
        cin >> n >> x;
        if(x < n * (n + 1) / 2){
            cout << -1  << endl;
        }else{
            ll diff = x - n * (n + 1) / 2;//差
            ll diffplus = diff / n;
            ll diffhani = diff % n;
            rep(j, n){
                if(j <= diffhani - 1) cout << (n - j + diffplus + 1) << " ";
                else cout << n - j + diffplus << " ";
            }
            cout << endl;
        }
    }


    return 0;
}