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
import java.util.*;

// (1,2,3,4,5,6,7,8,9,10)
// (1,9), (2,8), (3,7), (4,6)
// (1,4,5), (,)

public class problemA{

	static HashSet<Integer> execute(int n, int k){
		HashSet<Integer> list = new HashSet<Integer>();
		int res = 0;

		// Add all values greater than target sum
		for (int temp = n; k < temp; temp--){
			list.add(temp);
		}


		for (int i = 1; i < k; i+=2){
			list.add(i);
		}
		return list;
	}

	public static void main(String[] args){
		Scanner myScanner = new Scanner(System.in);
		HashSet<Integer> solution;
		int T = myScanner.nextInt();

		for (int i = 0; i < T; i++){
			// 1 <= k <= n <= 1000
			int n = myScanner.nextInt();	// Range of numbers (1,..,.n)
			int k = myScanner.nextInt();	// Target sum
			int answ = 0;

			solution = execute(n,k);

			Iterator<Integer> it = solution.iterator();

			System.out.println(solution.size());
			while(it.hasNext()){
			        System.out.printf("%d ", it.next());
			     }
		  if (solution.size() > 0)
				System.out.println();
		}
	}
}
