#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int t;
    cin>>t;
    while(t--){
        ll n,x;
        cin>>n>>x;
        vector<ll> a(n);
        ll sum = 0;
        for(int i = 0;i<n;i++){
            a[i] = i + 1;
            sum += i + 1;
        }
        if(sum>x){
            cout<<-1<<endl;
            continue;
        }
        ll want = x - sum;
        vector<ll> b(n,0);
        for(int i = 0;i<n;i++){
            ll res = n - i;
            ll can = want / res;
            b[i] += can;
            want -= can * res;
        }
        for(int i = 0;i<n;i++){
            a[i] += b[i];
            if(i+1<n) b[i+1] += b[i];
        }
        reverse(a.begin(),a.end());
        for(int i = 0;i<n;i++){
            if(i) cout<<" ";
            cout<<a[i];
        }
        cout<<endl;
    }
}