#include <bits/stdc++.h>
using namespace std;
template <typename T> using min_priority_queue = priority_queue<T,vector<T>,greater<T>>;

template<typename T>
void printv(vector<T> &v){
    bool b = false;
    for(auto i : v){
        if(b) cout << " ";
        else b = true;
        cout << i;
    }
    cout << endl;
}

template <typename T>
bool chmin(T &a, const T& b) {
    if (a > b) {
        a = b;  // aをbで更新
        return true;
    }
    return false;
}

template <typename T>
bool chmax(T &a, const T& b) {
    if (a < b) {
        a = b;  // aをbで更新
        return true;
    }
    return false;
}

int64_t ceil(int64_t x, int64_t y){
    if(y < 0){
        x *= -1;
        y *= -1;
    }
    int64_t r = x%y;
    r = (r+y)%y;
    if(r) x += y-r;
    return x/y;
}

void yn(bool b){
    if(b) cout << "Yes" << endl;
    else cout << "No" << endl;
}

bool debug;
bool randomInput;
void input(){
    if(debug && randomInput){
        
    }
    else{
        
    }
    return;
}

void calc(){
    int T; cin >> T;
    for(int i = 0; i < T; i++){
        int64_t N;
        int64_t X;
        cin >> N >> X;

        if(N*(N+1)/2 > X) {
            cout << -1 << endl;
            continue;
        }
        int64_t a0 = ceil((X + N*(N-1)/2), N);
        vector<int64_t> A(N);
        for(int j = 0; j < N; j++){
            A[j] = a0 - j;
        }

        int64_t d = a0*N - N*(N-1)/2 - X;
        for(int j = N-1; j >= N-d; j--){
            A[j]--;
        }

        for(int j = 0; j < N; j++){
            if(j) cout << " ";
            cout << A[j];
        }
        cout << endl;
    }
    return;
}

int64_t ansSimple;
void calcSimple(){
    return;
}

void calc1(){
    int t; cin >> t;
    for(int i = 0; i < t; i++){
        input();
        calc();
        calcSimple();
    }
}

int main(){
    debug = 0;
    randomInput = 0;
    srand(time(NULL));
    cout << fixed << setprecision(12);
    if(debug){
        calc1();
    }
    else{
        input();
        calc();
    }
    return 0;
}
//