description: Alice and Borys are playing tennis.
  
  A tennis match consists of games. In each game, one of the players is serving and the other one is receiving.
  
  Players serve in turns: after a game where Alice is serving follows a game where Borys is serving, and vice versa.
  
  Each game ends with a victory of one of the players. If a game is won by the serving player, it's said that this player holds serve. If a game is won by the receiving player, it's said that this player breaks serve.
  
  It is known that Alice won a games and Borys won b games during the match. It is unknown who served first and who won which games.
  
  Find all values of k such that exactly k breaks could happen during the match between Alice and Borys in total.
  
  Input
  
  Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 10^3). Description of the test cases follows.
  
  Each of the next t lines describes one test case and contains two integers a and b (0 ≤ a, b ≤ 10^5; a + b > 0) — the number of games won by Alice and Borys, respectively.
  
  It is guaranteed that the sum of a + b over all test cases does not exceed 2 ⋅ 10^5.
  
  Output
  
  For each test case print two lines.
  
  In the first line, print a single integer m (1 ≤ m ≤ a + b + 1) — the number of values of k such that exactly k breaks could happen during the match.
  
  In the second line, print m distinct integers k_1, k_2, …, k_m (0 ≤ k_1 < k_2 < … < k_m ≤ a + b) — the sought values of k in increasing order.
  
  Example
  
  Input
  
  
  3
  2 1
  1 1
  0 5
  
  
  Output
  
  
  4
  0 1 2 3
  2
  0 2
  2
  2 3
  
  Note
  
  In the first test case, any number of breaks between 0 and 3 could happen during the match: 
  
    * Alice holds serve, Borys holds serve, Alice holds serve: 0 breaks; 
    * Borys holds serve, Alice holds serve, Alice breaks serve: 1 break; 
    * Borys breaks serve, Alice breaks serve, Alice holds serve: 2 breaks; 
    * Alice breaks serve, Borys breaks serve, Alice breaks serve: 3 breaks. 
  
  
  
  In the second test case, the players could either both hold serves (0 breaks) or both break serves (2 breaks).
  
  In the third test case, either 2 or 3 breaks could happen: 
  
    * Borys holds serve, Borys breaks serve, Borys holds serve, Borys breaks serve, Borys holds serve: 2 breaks; 
    * Borys breaks serve, Borys holds serve, Borys breaks serve, Borys holds serve, Borys breaks serve: 3 breaks. 
solution: import sys
  from random import *
  from bisect import *
  from itertools import permutations as prm,product
  from heapq import *
  #from collections import deque
  from math import gcd,sqrt,ceil,floor
  from functools import *
  from copy import *
  pl=1
  sys.setrecursionlimit(10**5)
  if pl:
  	input=sys.stdin.readline
  else:	
  	sys.stdin=open('input.txt', 'r')
  	sys.stdout=open('outpt.txt','w')
  
  def li():
  	return [int(xxx) for xxx in input().split()]
  def fi():
  	return int(input())
  def si():
  	return list(input().rstrip())	
  def mi():
  	return 	map(int,input().split())	
  def ff():
  	sys.stdout.flush()
  def google(tc,*ans):
  	print("Case #"+str(tc)+":",*ans)	
  def bits(i,n):
  	p=bin(i)[2:]
  	return (n-len(p))*"0"+p			
  t=fi()
  f=t	
  
  while t:
  	t-=1
  	a,b=mi()
  	ans=[]
  	for i in range(a+b+1):
  		#Alice serves first
  		al=(a+b+1)//2
  		bo=(a+b)//2
  		aw=(a+i-al)//2
  		bw=i-(bo+i-b)//2
  		if (bo+i-b)%2==0 and (a+i-al)%2==0 and 0<=aw<=i and 0<=bw<=i and aw==i-bw and aw<=a and bw<=b:
  			ans.append(i)
  			continue
  		#Bob
  		al=(a+b)//2
  		bo=(a+b+1)//2
  		aw=(a+i-al)//2
  		bw=i-(bo+i-b)//2
  		#print(i,al,bo,aw,bw)
  		if (bo+i-b)%2==0 and (a+i-al)%2==0 and 0<=aw<=i and 0<=bw<=i and aw==i-bw and aw<=a and bw<=b:
  			ans.append(i)
  			continue
  	print(len(ans))
  	print(*ans)	
  