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 java.util.*;
  //import java.util.Stack;
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.OutputStream;
  import java.io.PrintWriter;
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.Collections;
  import java.util.HashMap;
  import java.util.HashSet;
  import java.util.LinkedList;
  import java.util.Map;
  import java.util.PriorityQueue;
  import java.util.Queue;
  import java.util.SortedSet;
  import java.util.Stack;
  import java.util.StringTokenizer;
  import java.util.TreeMap;
  import java.util.TreeSet;
  import java.io.OutputStream;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.OutputStream;
  import java.io.PrintWriter;
  import java.io.BufferedWriter;
  import java.io.Writer;
  import java.io.OutputStreamWriter;
  import java.util.InputMismatchException;
  import java.io.IOException;
  import java.io.InputStream;
  public class Main {
  
  
      static class FastReader
      {
          BufferedReader br;
          StringTokenizer st;
          public FastReader()
          {
              br = new BufferedReader(new
                      InputStreamReader(System.in));
          }
          String next()
          {
              while (st == null || !st.hasMoreElements())
              {
                  try
                  {
                      st = new StringTokenizer(br.readLine());
                  }
                  catch (IOException  e)
                  {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
          int nextInt()
          {
              return Integer.parseInt(next());
          }
          long nextLong()
          {
              return Long.parseLong(next());
          }
          double nextDouble()
          {
              return Double.parseDouble(next());
          }
          String nextLine()
          {
              String str = "";
              try
              {
                  str = br.readLine();
              }
              catch (IOException e)
              {
                  e.printStackTrace();
              }
              return str;
          }
      }
  
      public static int gcd(int a, int b)
      {
          if (b == 0)
              return a;
          return gcd(b, a % b);
      }
  
       static class obj{
             int a1;
             int a2;
             obj(int a1,int a2){
                 this.a1=a1;
                 this.a2=a2;
             }
         }
         static  class sortby implements Comparator<obj>{
             public   int compare(obj o1,obj o2){
                 return o1.a1>o2.a1?1:-1;
             }
         }
      static int LowerBound(int a[], int x) { // x is the target value or key
          int l=-1,r=a.length;
          while(l+1<r) {
              int m=(l+r)>>>1;
              if(a[m]>=x) r=m;
              else l=m;
          }
          return r;
      }
      static int UpperBound(int a[], int x) {// x is the key or target value
          int l=-1,r=a.length;
          while(l+1<r) {
              int m=(l+r)>>>1;
              if(a[m]<=x) l=m;
              else r=m;
          }
          return l+1;
      }
      static long power(long x,long y,long p){
          String b1=""+y;
          long d=p;
          long reminderb=0;
          for(int i=0;i<b1.length();i++){
              reminderb=(reminderb*10+b1.charAt(i)-'0')%d;
          }
          y=reminderb;
          long res=1;
          x=x%p;
          while(y>0){
              if((y&1)>0)
                  res=(res*x)%p;
              y=y>>1;
              x=(x*x)%p;
          }
          return res;
      }
  //static ArrayList<Integer>[] a;
     // static int[] vis;
      //static int[] col;
    /*  static boolean dfs(int i,int c){
          vis[i]=1;
          col[i]=c;
          //System.out.println(i+" "+c);
          for(int j:a[i]){
              if(vis[j]==0) {
                  if (dfs(j, c ^ 1) == false)
                      return false;
              }
              else
                  if(col[i]==col[j])
                      return false;
          }
          return true;
      }*/
      public static void main(String[] args) {
          FastReader s = new FastReader();
          //InputStream inputStream = System.in;
          OutputStream outputStream = System.out;
          PrintWriter out = new PrintWriter(outputStream);
          //Scanner s=new Scanner(System.in);
        int t = s.nextInt();
  
        while(t-->0) {
            int a=s.nextInt();
            int b=s.nextInt();
            int min=Math.min(a,b);
            int l=(a+b)/2-min;
            int u=(a+b)-(a+b)/2+min;
            if((l%2==1&&u%2==1)||(l%2==0&&u%2==0)){
                int c=(u-l)/2+1;
                out.println(c);
                for(int i=l;i<=u;i=i+2){
                    out.print(i+" ");
                }
                out.println();
            }
            else{
                int c=(u-l)+1;
                out.println(c);
                for(int i=l;i<=u;i++){
                    out.print(i+" ");
                }
                out.println();
            }
         }
         out.close();
      }
  }
  