import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { public static void main(String[] args) { Scanner in = new Scanner(System.in); int testQ = in.nextInt(); for (int testQI = 0; testQI < testQ; testQI++) { int n = in.nextInt(); int k = in.nextInt(); int []arr = new int[n + 1]; for (int i = 1; i <= n; i++) { arr[i] = 1; } ArrayList list = new ArrayList<>(); ArrayList newList = new ArrayList<>(); int currentN = n - 1; while (currentN > 0) { if (k - currentN >= 0) { k -= currentN; list.add(currentN); } currentN--; } if (k > 0) { System.out.println(-1); } else { if (list.size() > 0) { int last = list.get(0); for (int w = list.size() - 1; w >= 1; --w) { last = list.get(w) + 1; //System.out.println(list.get(w) + 1); newList.add(list.get(w) + 1); } //System.out.println(last + 1); newList.add(last + 1); for (int w = newList.size() - 1; w >= 0; --w) { System.out.print(newList.get(w) + " "); arr[newList.get(w)] = 0; } } for (int w = 1; w <= n; w++) { if (arr[w] == 1) { System.out.print(w + " "); } } System.out.println(); } } } }