#!/bin/python3

import sys, math

def lena_sort(nums):
    if (len(nums) <= 1):
        return nums
    pivot = nums[0]
    less = []
    more = []
    for i in range(len(nums)):
        #if (nums[i] != pivot):
        #    print("Comparison")
        if (nums[i] < pivot):
            less.append(nums[i])
        if (nums[i] > pivot):
            more.append(nums[i])
            
    sorted_less = lena_sort(less)
    sorted_more = lena_sort(more)
    
    ans = sorted_less
    ans.append(pivot)
    ans.extend(sorted_more)
    
    return arr



q = int(input().strip())
for a0 in range(q):
    length,c = input().strip().split(' ')
    length,c = [int(length),int(c)]
    arr = []
    swaps = sum(range(1,length)) #maximum possible number of comparisons
    if c > swaps: 
        print('-1')
    else:
        for i in range(1,length+1):
            arr.append(i)
        print(*arr)
        #for _ in range(length):
        
        #arr = 
            
            
            

#print(lena_sort([3,4,5,2,1]))