Problem: You are given two integers n and k. You are asked to choose maximum number of distinct integers from 1 to n so that there is no subset of chosen numbers with sum equal to k.

A subset of a set is a set that can be obtained from initial one by removing some (possibly all or none) elements of it.

Input

The first line contains the number of test cases T (1 ≤ T ≤ 100).

Each of the next T lines contains two integers n and k (1 ≤ k ≤ n ≤ 1000) — the description of test cases.

Output

For each test case output two lines. In the first line output a single integer m — the number of chosen integers.

In the second line output m distinct integers from 1 to n — the chosen numbers.

If there are multiple answers, print any. You can print the numbers in any order.

Example

Input


3
3 2
5 3
1 1


Output


2
3 1 
3
4 5 2 
0

Solution (in JAVA):

Solution:

import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.Vector;
import javafx.util.Pair;

public class Codeforces{

	static long gcd(long a,long b){
		if(b==0){
			return a;
		}
		return gcd(b,a%b);
	}

	public static void main(String[] args){

		Scanner ob=new Scanner(System.in);
		int t=ob.nextInt();
		while(t-->0){
			int n=ob.nextInt();
			int m=ob.nextInt();
			Vector<Integer>v=new Vector();
			for(int i=m+1;i<=n;i++){
				v.add(i);
			}
			for(int i=m-1;i>=Math.ceil(m*1.0/2);i--){
				v.add(i);
			}
			System.out.println(v.size());
			for(int i=0;i<v.size();i++){System.out.print(v.get(i)+" ");}
			System.out.println();
		}
	}
}