import java.util.LinkedList;
import java.util.Scanner;

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();
            LinkedList<Integer> base = new LinkedList<>();
            base.add(1);
            LinkedList<Integer> ans = backtrack(0, c, len, base);
            if (ans == null) {
                System.out.println(-1);
            } else {
                while (!ans.isEmpty()) {
                    System.out.print(ans.poll());
                    if (ans.isEmpty()) {
                        System.out.println();
                    } else {
                        System.out.print(' ');
                    }
                }
            }
        }
    }

    private static LinkedList<Integer> backtrack(int k, int c, int len, LinkedList<Integer> list) {
        if (list.size() == len) {
            if (k == c) {
                return list;
            } else {
                return null;
            }
        } else {
            list.addLast(list.size() + 1);
            LinkedList<Integer> ans = backtrack(k == 0 ? 0 : k + 1, c, len, list);
            if (ans == null) {
                list.pollLast();
                list.addFirst(list.size() + 1);
                ans = backtrack(k  + list.size() - 1, c, len, list);
                if (ans != null) {
                    return ans;
                } else {
                    list.pollFirst();
                    return null;
                }
            } else {
                return ans;
            }
        }
    }
}