#!/bin/python3
import sys
from math import factorial
from itertools import permutations
q = int(input())

def array_print(arr, l):
    for i in range(l):
        print(arr[i], end=" " if i != l - 1 else "\n")

def lena_sort(arr):
    if len(arr) <= 1:
        return arr, len(arr)
        
    pivot = arr[0]
    less = []
    more = []
    
    for item in arr:
        if item < pivot:
            less.append(item)
        elif item > pivot:
            more.append(item)
    sorted_less, num1 = lena_sort(less)
    sorted_more, num2 = lena_sort(more)
    
    return sorted_less + [pivot] + sorted_more, num1 + num2
    
for a0 in range(q):
    l, c = input().split(' ')
    l, c = int(l), int(c)
    if c == 0:
        array_print([x for x in range(1, l + 1)], l)
    elif l < 1:
        print(-1)
    elif factorial(l - 1) < c:
        print(-1)
    else:
        prlist = list(permutations([x for x in range(1, l + 1)], l))
        print(len(prlist))
        print(prlist)
        print(lena_sort([4, 3, 2, 1]))