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: //package competitveprogramming;
  
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.Scanner;
  import java.util.StringTokenizer;
  
  
  
  import java.util.*;
    
  public class er110a
  {
      //By shwetank_verma
  	static boolean visited[][];
  	static int dx[]= {-1,0,1,0};
  	static int dy[]= {0,1,0,-1};
  	static boolean isValid(char ch[][],int x,int y,int n,int m) {
  		if(x<0||x>=n||y<0||y>=m) {
  			return false;
  		}
  		if(ch[x][y]=='#'||visited[x][y]) {
  			return false;
  		}
  		return true;
  		
  	}
  	static void dfs(char ch[][],int x,int y,int n,int m) {
  		visited[x][y]=true;
  		for(int i=0;i<4;i++) {
  			if(isValid(ch,x+dx[i],y+dy[i],n,m))
  			dfs(ch,x+dx[i],y+dy[i],n,m);
  		}
  	}
  	static class Point implements Comparable<Point>
  	{
  	    double x;int y;
  	    Point(double x, int y)
  	    {
  	        this.x = x;
  	        this.y = y;
  	    }
  	    
  	    public int compareTo(Point P)
  	    {
  	        return (int)(this.x - P.x);
  	    }
  	}
  	static long fact(long n) {
  		long ans=1;
  		for(int i=2;i<=n;i++) {
  			ans=(ans*i)%mod;
  		}
  		return ans%mod;
  	}
  	public static void main(String[] args)
      {
          FastReader sc=new FastReader();
          
                  int t=1;
                  t=sc.nextInt();
                  while(t-->0){
                  	int a=sc.nextInt();
                  	int b=sc.nextInt();
                  	int k=(a+b+1)/2;
                  	int s=0,e=Math.min(a, k)+Math.min(b, k);
                  	if(a>=k)
              			s=a-k;
              		else
              			s=b-k;
                  	StringBuilder sb=new StringBuilder();
                  	if((a+b)%2!=0) {
                  		int c=0;
                  		for(int i=s;i<=e;i++) {
                  			sb.append(i+" ");
                  			c++;
                  		}
                  		System.out.println(c);
                  		System.out.println(sb);
                  	}
                  	else {
                  		int c=0;
                  		for(int i=s;i<=e;i+=2) {
                  			sb.append(i+" ");
                  			c++;
                  		}
                  		System.out.println(c);
                  		System.out.println(sb);
                  	}
                  }
                  
             
           
      }
  
  static void ruffleSort(long[] a) {
  		int n=a.length;
  		Random r=new Random();
  		for (int i=0; i<a.length; i++) {
  			long oi=r.nextInt(n), temp=a[i];
  			a[i]=a[(int)oi];
  			a[(int)oi]=temp;
  		}
  		Arrays.sort(a);
  	}
  static void ruffleSort(int[] a) {
  		int n=a.length;
  		Random r=new Random();
  		for (int i=0; i<a.length; i++) {
  			int oi=r.nextInt(n), temp=a[i];
  			a[i]=a[oi];
  			a[oi]=temp;
  		}
  		Arrays.sort(a);
  	}
  
      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;
          }
      }
      static int mod=1000000007;
      static boolean primes[]=new boolean[100002];
      static ArrayList<Integer> b=new ArrayList<>();
      static boolean seive(int n){
          Arrays.fill(primes,true);
          primes[0]=primes[1]=false;
          for(int i=2;i*i<=n;i++){
              if(primes[i]==true){
                  for(int p=i*i;p<=n;p+=i){
                      primes[p]=false;
                  }
              }
          }
          if(n<1000007){
          	for(int i=2;i<=n;i++) {
          		if(primes[i])
          			b.add(i);
          	}
              return primes[n];
          }
          return false;
          
      }
      static int gcd(int a,int b){
          if(b==0)
          return a;
          return gcd(b,a%b);
      }
      static long GCD(long a,long b){
          if(b==0)
          return a;
          return GCD(b,a%b);
      }
      static ArrayList<Integer> segseive(int l,int r){
      	
      	ArrayList<Integer> isprime=new ArrayList<Integer>();
      	boolean p[]=new boolean[r-l+1];
      	Arrays.fill(p, true);
          
      	for(int i=0;b.get(i)*b.get(i)<=r;i++) {
      		int currprime=b.get(i);
      		int base=(l/currprime)*currprime;
      		if(base<l) {
      			base+=currprime;
      		}
      		for(int j=base;j<=r;j+=currprime) {
      			p[j-l]=false;
      		}
      		
      		
      		if(base==currprime) {
      			p[base-l]=true;
      		}
      		
      	}
      	for(int i=0;i<=r-l;i++) {
      		if(p[i])
      			isprime.add(i+l);
      	}
      	return isprime;
      }
        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;
   }
  
    
       
  }
  