def solve(leni, ci):
    global count
    # print(leni, ci)
    a = []
    for i in range(1, leni+1):
        a.append(i)
    n = leni-1
    minComparisons =  n-1
    maxComparisons = n * (n + 1) / 2

    count = 0
    # print(lena_sort(a), count)

    if ci > maxComparisons or ci < minComparisons:
        return -1
    if ci == minComparisons:
        return " ".join(list(map(str, a)))
    if ci == maxComparisons:
        return " ".join(reversed(list(map(str, a))))
    return " ".join(list(map(str, a)))


q = int(input())
for _ in range(q):
    leni, ci = map(int, input().split())
    print(solve(leni, ci))