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: /*==========================================================================
  *   	AUTHOR:    RonWonWon
  *   	CREATED:   25.08.2021 22:45:01        
  /*==========================================================================*/
  import java.io.*;
  import java.util.*;
  
  public class B {
  	
  	public static void main(String[] args) throws IOException {
  		/*
      in.ini();
      PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
      */
      long startTime = System.nanoTime();
      int t = in.nextInt(), T = 1;  
      while(t-->0) { 
        int a = in.nextInt(), b = in.nextInt();
        int n = a+b;
  			PriorityQueue<Integer> pq = new PriorityQueue<>();
        if(n%2==0){
  				int x = n/2;
  				x = Math.min(x,a) + Math.min(x,b);
  				for(int i=0;i<=Math.min(a,b);i++,x-=2) pq.add(x);
        }
        else{
        	int x = n/2 + 1;
        	x = Math.min(x,a) + Math.min(x-1,b);
        	for(int i=0;i<=Math.min(a,b);i++,x-=2) pq.add(x);
        	x = n/2 + 1;
        	x = Math.min(x-1,a) + Math.min(x,b);
        	for(int i=0;i<=Math.min(a,b);i++,x-=2) pq.add(x);
        }
        out.println(pq.size());
        while(!pq.isEmpty()) out.print(pq.poll()+" ");
        out.println();
     		//out.println("Case #"+T+": "+ans); T++;
      }
      /*
      startTime = System.nanoTime() - startTime;
      System.err.println("Time: "+(startTime/1000000));
      */
      out.flush();
  	}
  	
  	static FastScanner in = new FastScanner();
    static PrintWriter out = new PrintWriter(System.out);
  	static int oo = Integer.MAX_VALUE;
  	static long ooo = Long.MAX_VALUE;
  	
  	static class FastScanner {
  		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  		StringTokenizer st = new StringTokenizer("");
  		
  		void ini() throws FileNotFoundException {
  			br = new BufferedReader(new FileReader("input.txt"));
  		}
  		
  		String next() {
  			while(!st.hasMoreTokens())
  				try { st = new StringTokenizer(br.readLine()); }
  				catch(IOException e) {}
  			return st.nextToken();
  		}
  		
  		String nextLine(){
  			try{ return br.readLine(); } 
  			catch(IOException e) { } return "";
  		}
  		
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  		
  		int[] readArray(int n) {
  			int a[] = new int[n];
  			for(int i=0;i<n;i++) a[i] = nextInt();
  			return a;
  		}
  		
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  		
  		long[] readArrayL(int n) {
  			long a[] = new long[n];
  			for(int i=0;i<n;i++) a[i] = nextLong();
  			return a;
  		}
  		
  		double nextDouble() {
  			return Double.parseDouble(next());
  		}
  		
  		double[] readArrayD(int n) {
  			double a[] = new double[n];
  			for(int i=0;i<n;i++) a[i] = nextDouble();
  			return a;
  		}
  	}
  
  	static final Random random = new Random();
  
  	static void ruffleSort(int[] a){
  		int n = a.length;
  		for(int i=0;i<n;i++){
  			int j = random.nextInt(n), temp = a[j];
  			a[j] = a[i]; a[i] = temp;
  		}
  		Arrays.sort(a); 	
  	}
  	
  	static void ruffleSortL(long[] a){
  		int n = a.length;
  		for(int i=0;i<n;i++){
  			int j = random.nextInt(n);
  			long temp = a[j];
  			a[j] = a[i]; a[i] = temp;
  		}
  		Arrays.sort(a); 	
  	}
  }
  