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

public class Hack46_2 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner s = new Scanner(System.in);
		int q = s.nextInt();
		while(q-->0){
			int size = s.nextInt();
			int ops = s.nextInt();
			LinkedList<Integer> ll = solve(size, ops);
			print(ll);
			System.out.println();
		}


	}

	private static void print(LinkedList<Integer> ll) {
		// TODO Auto-generated method stub
		while(ll.size()>0){
			int ele = ll.removeFirst();
			System.out.print(ele+" ");
		}
	}

	private static LinkedList<Integer> solve(int size, int ops) {
		if(ops-size>size*2){
			LinkedList<Integer> ll = new LinkedList<>();
			ll.add(-1);
			return ll;
		}
		boolean flag = (size-ops)%2==0;
		int i = 1;
		LinkedList<Integer> ll = new LinkedList<>();
		ll.add(i++);
		if(flag){
			while(i<=size)
			ll.addFirst(i++);
			
		}
		else{
			while(i<=size)
				if(i%2==0){
				ll.addFirst(i++);
				}
				else{
					ll.addLast(i++);
				}
		}
		return ll;
	}

}