#!/bin/python

import sys
import itertools

compare = 0
def lena_sort(nums):
    global compare
    if (len(nums) <= 1):
        return nums

    #print ["nums",nums]
    pivot = nums[0]
    less = []
    more = []
    #print ["pivot", pivot]
    #print ["len(nums)",len(nums)]
    for i in xrange(1,len(nums)):
        # Comparison
        compare += 1
        if (nums[i] < pivot):
            less.append(nums[i])
        else:
            more.append(nums[i])
    sorted_less = lena_sort(less)
    sorted_more = lena_sort(more)
    sorted_less.append(pivot)
    ans = sorted_less + sorted_more
    return ans

def getOrder(b, c):
    global compare
    if (c == 2*len(b)):
        return b

    #print ["b",b]
    
    #pick = 4
    #num_greater = len(b) - 4
    #num_lower = len(b) - num_greater - 1

    for s in itertools.permutations(b):
        compare = 0
        #print list(s)
        a = lena_sort(list(s))
        #print ["Compare",compare]
        if compare == c:
            return ' '.join(map(str,list(s)))
    return a

compare = 0
q = int(raw_input().strip())
for a0 in xrange(q):
    lena,c = raw_input().strip().split(' ')
    lena,c = [int(lena),int(c)]
    # your code goes here
    if (c > 2*lena):
        print -1
    else:
        unorderedSet = list(range(1,lena+1))
        #print unorderedSet
        orderedSet = getOrder(unorderedSet, c)
        print orderedSet