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
def solution(count):
    for counting in range(count):
        integer_list = input().split(" ")
        integer_list = list(map(int, integer_list))
        answer_list = []
        n = integer_list[0]
        k = integer_list[1]
        for i in range(k,n):
            now = i+1
            answer_list.append(now)
        if n == 1:
            print('0')
            break    
        elif k%2 == 0:
            for j in range(k//2, k):
                answer_list.append(j)
        else:
            for j in range(k//2+1, k):
                answer_list.append(j)
        print(len(answer_list))
        answer = ''
        for i in answer_list:
            answer = answer + str(i) + ' '
        print(answer)

a = int(input())
solution(a)