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
# MasterKali

from sys import stdin
from collections import Counter
from math import sqrt, factorial, log10, log, floor, ceil
from itertools import permutations, combinations, combinations_with_replacement

input = stdin.readline
def li(): return list(map(int, input().split()))
def lis(): return list(map(str, input().split()))
def mp(): return map(int, input().split())
def inp(): return int(input())
def inps(): return str(input().strip())
def pr(n): return stdout.write(str(n)+"\n")

INF = float('inf')


def solve():
	n, k = mp()
	mx_sub = []
	mx = 0
	klis = set()
	klis.add(k)
	x = 1
	k -= 1
	while k > x:
		klis.add(x)
		k-=1
		x+=1
		
		

	for i in range(1, n+1):
		if i not in klis:
			mx_sub.append(i)

	
	print(len(mx_sub))
	print(*mx_sub)



t = inp()
for i in range(t):
	
	solve()
