import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int q = in.nextInt();
        for(int a0 = 0; a0 < q; a0++){
            int len = in.nextInt();
            int c = in.nextInt();
            int min = findMinComp(len);
            int max = findMaxComp(len);
            //System.out.println(min + " " + max);
            int a[] = new int[len];
            if(len == 1){
                //a[0] = 1;
                System.out.println(1);
            } else if(c > max || c < min) {
                System.out.println("-1");
            } else {
                if(c == max) {
                    for(int i=0;i<len;i++)
                        System.out.print(len-i + " ");
                    System.out.println();
                } else if(c == min) {
                    System.out.println(findStringIncaseOfMin(len));
                } else {
                    
                }
            }
        }
    }
    
    public static String findStringIncaseOfMin(int len) {
        String arr = "1";
        if(len%2!=0){
            int temp = 2;
            while(temp <= len) {
                if(temp%2==0){
                    arr = temp + " " + arr;
                } else {
                    arr += " " + temp;
                }
                temp++;
            }
        } else {
            return (findStringIncaseOfMin(len-1) + " " + len);
        }
        return arr;
    }
    
    public static int findMaxComp(int num){
        return (num*(num-1))/2;
    }
    
    public static int findMinComp(int num){
        if(num == 0)
            return 0;
        if(num%2!=0){
            return (num*num - 1) / 4;
        } else {
            return findMinComp(num - 1) + 2;
        }
    }
}