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: t = int(input())
  m = [0]*t
  k = [[] for i in range(t)]
  def change_num(num):
      if num%2 == 0:
          # return [n for n in range(0, num+2, 2)]
          return [0]+[num]
      else:
          # return [n for n in range(1, num+1, 2)]
          return list(set([1]+[num]))
  for case in range(t):
      a, b = [int(i) for i in input().split()]
      # a_now = a
      # b_now = b
      # for k_temp in range(a+b+1):
      #     print(abs(a-b)//2, (abs(a-b)+1)//2, change_num(k_temp))
      #     if abs(a-b)//2 in change_num(k_temp) or (abs(a-b)+1)//2 in change_num(k_temp):
      #         k[case].append(k_temp)
      #         m[case]+=1
      if a==b:
          k[case] = [i for i in range(0, a+b+1, 2)]
          m[case] = len(k[case])
      else:
          if abs(a-b)%2==0:
              m[case] = max(a,b)-abs(a-b)+1
              k[case] = [i for i in range(abs(a-b)//2, int((max(a,b)-(abs(a-b)+abs(a-b)//2)/2)*2+1), 2)]
          else:
              m[case] = a+b+2-abs(a-b)
              k[case] = [i for i in range(abs(a-b)//2, abs(a-b)//2+m[case])]
  for i in range(t):
      print(m[i])
      temp = k[i]
      temp = list(set(temp))
      temp.sort()
      for j in range(len(temp)):
          print(temp[j], end='')
          if j != len(temp)-1:
              print(' ', end='')
      print()
  