#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int q;
    cin>>q;
    for(int T=0;T<q;T++)
    {
        long double N;
        long double n=N;
        long double c;
        cin>>N>>c;
        if(N==1 and c!=0)
        {
            cout<<-1<<endl;
            continue;
        }
        if(N==1 and c==0)
        {
            cout<<1<<endl;
            continue;
        }
        if(c<N-1 or c>N*N)
        {
            cout<<-1;
            continue;
        }
        long double D=(1-n)*(1-n)-4*(n*n/2-n/2-c);
        long double a1=(-1+n+sqrtl(D))/2;
        long double a2=(-1+n-sqrtl(D))/2;
        int A=a1;
        if(A<0 or A>N-1)
            A=a2;
        if(A<0 or A>N-1)
        {
            cout<<-1;
            continue;
        }
        cout<<A+1<<" ";
        for(int i=A;i>=1;i--)
            cout<<i<<" ";
        for(int i=N;i>=A+2;i--)
            cout<<i<<" ";
        cout<<endl;
    }
    return 0;
}