#include<bits/stdc++.h>
using namespace std;
long long INFl = 1LL<<60;
int INFi = 1<<30;
int AlphaNum = 26;
long long MOD = 998244353;
int mod(long long N){
    return (N + MOD ) % MOD;
}
long long my_pow(int a,int b){
    long long rec=1;
    for(int i=0;i<b;i++){
        rec *= a;
    }
    return rec;
}
void query(){
    long long N,X;
    cin>>N>>X;
    long long sumN = (N*(N+1))/2;
    if(sumN > X){
        cout<<-1<<endl;
        return;
    }
    else{
        long long diff = X - sumN;
        vector<long long> A(N);
        for(int i=0;i<N;i++){
            A[i] = i+1;
        }
        A[N-1] += diff;
        for(const auto& a:A){
            cout<<a<<" ";
        }
        cout<<endl;
    }
}
int main(){
    int T;
    cin>>T;
    while(T--){
        query();
    }
    return 0;
}