#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
//libs
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <string>
#include <map>
#include <complex>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <queue>

using namespace std;
//defines
#define infll 8e18
#define ll long long
#define itn ll
#define vi vector<itn>
#define vvi vector<vi>
#define pii pair<itn,itn> 
//constants
const double eps = 1e-7;
const ll mod = 1000000007;
//end of definition

int cnt=0;
int N=2e5;
vi mi(N),ma(N);

void pr()
{
  
  mi[0]=0;ma[0]=0;
  mi[1]=0,ma[1]=0;
  for (int i=2;i<N;i++)
  {
    mi[i]=i-1+mi[i/2]+mi[(i-1)/2];
    ma[i]=i-1+ma[i-1];

  }
  int qw=0;
  return;
}

vi ans;
vi ans1;
inline void csmin(int l,int r)
{
  if (l>r)
    return;
  
  if (l==r)
  {

    ans.push_back(l);
    return;
  }
  
    ans.push_back((l+r)/2);
  csmin(l,(l+r)/2-1);
  
  csmin((l+r)/2+1,r);


}

vi lena_sort(vi nums) {
    if (nums.size() <= 1) {
        return nums;
    }
    int pivot = nums[0];
    vi less;
    vi more;
    for (int i = 1; i < nums.size(); ++i) {
    	// Comparison
      cnt++;
        if (nums[i] < pivot) {
          less.push_back(nums[i]);
        }
        else {
            more.push_back(nums[i]);
        }
    }
    vi sorted_less = lena_sort(less);
    vi sorted_more = lena_sort(more);
    sorted_less.push_back(pivot);
    for (int i=0;i<sorted_more.size();i++)
      sorted_less.push_back(sorted_more[i]);
    
    return sorted_less;
}

inline void r(int c,int n)
{
  c-=n-1;
  int b=ans.size();
  for (int i=0;i<(n+1)/2;i++)
  {
    int q=c-ma[i];
    if (q>=mi[n-i-1]&&q<=ma[n-i-1])
    {
      ans.push_back(i+1);
      for (int j=0;j<i;j++)
      {
        ans.push_back(j+1);
      }
      
      if (b+i+1<n+b)
      {
        ans1[b+i+1]+=i+1;
      
        ans1[b+n]-=i+1;
      }
      r(q,n-i-1);
      return;
    }
    q=c-mi[i];
    if (q>=mi[n-i-1]&&q<=ma[n-i-1])
    {
      ans.push_back(i+1);
      csmin(1,i);
      if (b+i+1<n+b)
      {
        ans1[b+i+1]+=i+1;
        ans1[b+n]-=i+1;
      }
      r(q,n-i-1);
      return;
    }
  }
}


void solve()
{
  ll n,c;
  cin >> n >> c;
  if (c>ma[n] || c<mi[n])
  {
    cout << -1 << endl;
    return ;
  }
  ans.clear();
  ans1.assign(n+100000,0);
  r(c,n);
  /*cnt=0;
  for (int i=0;i<n;i++)
    cnt+=ans1[i],ans[i]+=cnt;
  cnt=0;
  lena_sort(ans);
  cout << cnt << endl;*/
  cnt=0;
  for (int i=0;i<n;i++)
    {
      cnt+=ans1[i];
      cout << ans[i]+cnt << ' ';
  }
  cout << endl;


}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
	//freopen("input.txt", "w", stdout);
#endif
  pr();
  int n;
  cin >> n;
  for (int i=0;i<n;i++)
	solve();

	return 0;
}