using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
class Solution {
	static int w=0;
	public int psrt(int[]ar,int l,int r,int c  )
	{
		int i=r;
		int pivot=ar[r];
		int z=ar[r];
		int y=0;
		int r1=0;
		for(int j=r-1;j>=0;j--)
		{
			if(w==c)
			{
				r1=1;
				break;
			}
			if(ar[j]<pivot)
			{
				int t=ar[i];
				ar[i]=ar[j];
				ar[j]=t;
				i--;
		
			}
			w++;
		}
		y=Array.IndexOf(ar,pivot);
		int e=ar[i];
		ar[i]=ar[y];
		ar[y]=e;
		if(r1==1)
			return -1;
		return i;
	}
	public void sort(int []ar,int l ,int r,int c)
	{
		if(l<r)
		{
			int p=psrt(ar,l,r,c);
			if(p==-1)
				return;
			sort(ar,p+1,r,c);
			sort(ar,l,p-1,c);
		}
	}


    static void Main(String[] args) {
        int q = Convert.ToInt32(Console.ReadLine());
        for(int a0 = 0; a0 < q; a0++){
            string[] tokens_len = Console.ReadLine().Split(' ');
            int len = Convert.ToInt32(tokens_len[0]);
            int c = Convert.ToInt32(tokens_len[1]);
            // your code goes here
            int a=0;
               int []ar=new int[len];
            if(c>(len*(len-1))/2)
            {
            	a=-1;
            	     Console.WriteLine(a);
            }
            
         
            else
            {
            	for(int i=0;i<len;i++)
            	{
            		ar[i]=i+1;
            	}
            	Solution o=new Solution();
            	o.sort(ar,0,len-1,c);
            	for(int i=len-1;i>=0;i--)
            		Console.Write(ar[i]+" ");
            	Console.WriteLine();
            	
            }
       
        }
    }
}