#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
typedef long long LL;
const int NICO = 100000 + 10;
int q;vector<int> ans;
int vis[NICO];
LL len; LL c;
int main()
{
    cin >> q;
    while(q--)
    {
        cin >> len >> c;
        LL max_ = (LL)len * (len-1) / 2;
        int t = 2, ok = 1;
        if(len == 1)
        {
            if(c == 0) printf("1\n");
            else printf("-1\n");
            continue;
        }
        for(int i=1;i<=len;i++)
        {
            vis[i] = 0;
        }
        if(c > max_) ok = 0;
        LL tmp = max_ - c;
        if(ok) 
        {
            while(len - t < tmp)
            {
                tmp -= (len-t);
                t += 2;
                if(t > len)
                {
                    ok = 0;
                    break;
                }
            }
        }
        if(ok)
        {
            for(int i=2;i<t;i+=2)
            {
                ans.push_back(len - i);vis[len-i] = 1;
            }
            for(int i=1;i<=len;i++)
            {
                if(!vis[i]) ans.push_back(i);
            }
            for(int i=len-t/2;i>=t/2;i--)
            {
                if(tmp)
                {
                    swap(ans[i],ans[i-1]);
                    tmp --;
                }
            }
            for(int i=0;i<len;i++)
            {
                printf("%d", ans[i]);
                if(i == len-1) printf("\n");
                else printf(" ");
            }
        } else {
            printf("-1\n");
        }
    }
}