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.io.IOException;
  import java.io.InputStream;
  import java.io.OutputStream;
  import java.io.PrintWriter;
  import java.math.BigInteger;
  import java.util.*;
  
  /**
   * @author Mubtasim Shahriar
   */
  
  public class Cr740 {
  
      public static void main(String[] args) {
  
          InputStream inputStream = System.in;
          OutputStream outputStream = System.out;
          InputReader sc = new InputReader(inputStream);
          PrintWriter out = new PrintWriter(outputStream);
          Solver solver = new Solver();
  		int t = sc.nextInt();
  //        int t = 1;
          while (t-- != 0) {
              solver.solve(sc, out);
          }
          out.close();
  
      }
  
      static class Solver {
          public void solve(InputReader sc, PrintWriter out) {
              int a = sc.nextInt();
              int b = sc.nextInt();
              int total = a+b;
              // afirst
              int maxwin = (total+1)/2;
              int less = total-maxwin;
              TreeSet<Integer> ts= new TreeSet<>();
              if(a==maxwin) {
                  for(int i = 0; i <= total; i += 2) {
                      ts.add(i);
                  }
              } else if(a>maxwin) {
                  int start = a-maxwin;
                  int pstart = start;
  //                for(; start<=less; start += 2) ts.add(start);
                  for(int i = 0; i <= less-pstart; i++, start += 2) ts.add(start);
              } else if(a<maxwin){
                  int extra = maxwin-a;
                  for(int i = 0; i <= Math.min(a,less); extra += 2, i++) {
                      ts.add(extra);
                  }
              }
  
              //bfirst
              if(b==maxwin) {
                  for(int i = 0; i <= total; i += 2) {
                      ts.add(i);
                  }
              } else if(b>maxwin) {
                  int start = b-maxwin;
                  int pstart = start;
  //                for(; start<=less; start += 2) ts.add(start);
                  for(int i = 0; i <= less-pstart; i++, start += 2) ts.add(start);
              } else if(b<maxwin){
                  int extra = maxwin-b;
                  for(int i = 0; i <= Math.min(b,less); extra += 2, i++) {
                      ts.add(extra);
                  }
              }
              boolean first = true;
              out.println(ts.size());
              while(!ts.isEmpty()) {
                  if(!first) out.print(" ");
                  first = false;
                  out.print(ts.pollFirst());
              }
              out.println();
          }
      }
  
      static void sort(int[] arr) {
          Random rand = new Random();
          int n = arr.length;
          for (int i = 0; i < n; i++) {
              int idx = rand.nextInt(n);
              if (idx == i) continue;
              arr[i] ^= arr[idx];
              arr[idx] ^= arr[i];
              arr[i] ^= arr[idx];
          }
          Arrays.sort(arr);
      }
  
      static void sort(long[] arr) {
          Random rand = new Random();
          int n = arr.length;
          for (int i = 0; i < n; i++) {
              int idx = rand.nextInt(n);
              if (idx == i) continue;
              arr[i] ^= arr[idx];
              arr[idx] ^= arr[i];
              arr[i] ^= arr[idx];
          }
          Arrays.sort(arr);
      }
  
      static void sortDec(int[] arr) {
          Random rand = new Random();
          int n = arr.length;
          for (int i = 0; i < n; i++) {
              int idx = rand.nextInt(n);
              if (idx == i) continue;
              arr[i] ^= arr[idx];
              arr[idx] ^= arr[i];
              arr[i] ^= arr[idx];
          }
          Arrays.sort(arr);
          int l = 0;
          int r = n - 1;
          while (l < r) {
              arr[l] ^= arr[r];
              arr[r] ^= arr[l];
              arr[l] ^= arr[r];
              l++;
              r--;
          }
      }
  
      static void sortDec(long[] arr) {
          Random rand = new Random();
          int n = arr.length;
          for (int i = 0; i < n; i++) {
              int idx = rand.nextInt(n);
              if (idx == i) continue;
              arr[i] ^= arr[idx];
              arr[idx] ^= arr[i];
              arr[i] ^= arr[idx];
          }
          Arrays.sort(arr);
          int l = 0;
          int r = n - 1;
          while (l < r) {
              arr[l] ^= arr[r];
              arr[r] ^= arr[l];
              arr[l] ^= arr[r];
              l++;
              r--;
          }
      }
  
      static class InputReader {
          private boolean finished = false;
  
          private InputStream stream;
          private byte[] buf = new byte[1024];
          private int curChar;
          private int numChars;
          private SpaceCharFilter filter;
  
          public InputReader(InputStream stream) {
              this.stream = stream;
          }
  
          public int read() {
              if (numChars == -1) {
                  throw new InputMismatchException();
              }
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  } catch (IOException e) {
                      throw new InputMismatchException();
                  }
                  if (numChars <= 0) {
                      return -1;
                  }
              }
              return buf[curChar++];
          }
  
          public int peek() {
              if (numChars == -1) {
                  return -1;
              }
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  } catch (IOException e) {
                      return -1;
                  }
                  if (numChars <= 0) {
                      return -1;
                  }
              }
              return buf[curChar];
          }
  
          public int nextInt() {
              int c = read();
              while (isSpaceChar(c)) {
                  c = read();
              }
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              int res = 0;
              do {
                  if (c < '0' || c > '9') {
                      throw new InputMismatchException();
                  }
                  res *= 10;
                  res += c - '0';
                  c = read();
              } while (!isSpaceChar(c));
              return res * sgn;
          }
  
          public long nextLong() {
              int c = read();
              while (isSpaceChar(c)) {
                  c = read();
              }
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              long res = 0;
              do {
                  if (c < '0' || c > '9') {
                      throw new InputMismatchException();
                  }
                  res *= 10;
                  res += c - '0';
                  c = read();
              } while (!isSpaceChar(c));
              return res * sgn;
          }
  
          public String nextString() {
              int c = read();
              while (isSpaceChar(c)) {
                  c = read();
              }
              StringBuilder res = new StringBuilder();
              do {
                  if (Character.isValidCodePoint(c)) {
                      res.appendCodePoint(c);
                  }
                  c = read();
              } while (!isSpaceChar(c));
              return res.toString();
          }
  
          public boolean isSpaceChar(int c) {
              if (filter != null) {
                  return filter.isSpaceChar(c);
              }
              return isWhitespace(c);
          }
  
          public static boolean isWhitespace(int c) {
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
          }
  
          private String readLine0() {
              StringBuilder buf = new StringBuilder();
              int c = read();
              while (c != '\n' && c != -1) {
                  if (c != '\r') {
                      buf.appendCodePoint(c);
                  }
                  c = read();
              }
              return buf.toString();
          }
  
          public String readLine() {
              String s = readLine0();
              while (s.trim().length() == 0) {
                  s = readLine0();
              }
              return s;
          }
  
          public String readLine(boolean ignoreEmptyLines) {
              if (ignoreEmptyLines) {
                  return readLine();
              } else {
                  return readLine0();
              }
          }
  
          public BigInteger readBigInteger() {
              try {
                  return new BigInteger(nextString());
              } catch (NumberFormatException e) {
                  throw new InputMismatchException();
              }
          }
  
          public char nextCharacter() {
              int c = read();
              while (isSpaceChar(c)) {
                  c = read();
              }
              return (char) c;
          }
  
          public double nextDouble() {
              int c = read();
              while (isSpaceChar(c)) {
                  c = read();
              }
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              double res = 0;
              while (!isSpaceChar(c) && c != '.') {
                  if (c == 'e' || c == 'E') {
                      return res * Math.pow(10, nextInt());
                  }
                  if (c < '0' || c > '9') {
                      throw new InputMismatchException();
                  }
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              if (c == '.') {
                  c = read();
                  double m = 1;
                  while (!isSpaceChar(c)) {
                      if (c == 'e' || c == 'E') {
                          return res * Math.pow(10, nextInt());
                      }
                      if (c < '0' || c > '9') {
                          throw new InputMismatchException();
                      }
                      m /= 10;
                      res += (c - '0') * m;
                      c = read();
                  }
              }
              return res * sgn;
          }
  
          public boolean isExhausted() {
              int value;
              while (isSpaceChar(value = peek()) && value != -1) {
                  read();
              }
              return value == -1;
          }
  
          public String next() {
              return nextString();
          }
  
          public SpaceCharFilter getFilter() {
              return filter;
          }
  
          public void setFilter(SpaceCharFilter filter) {
              this.filter = filter;
          }
  
          public interface SpaceCharFilter {
              public boolean isSpaceChar(int ch);
          }
  
          public int[] nextIntArray(int n) {
              int[] array = new int[n];
              for (int i = 0; i < n; ++i) array[i] = nextInt();
              return array;
          }
  
          public int[] nextSortedIntArray(int n) {
              int array[] = nextIntArray(n);
              Arrays.sort(array);
              return array;
          }
  
          public int[] nextSumIntArray(int n) {
              int[] array = new int[n];
              array[0] = nextInt();
              for (int i = 1; i < n; ++i) array[i] = array[i - 1] + nextInt();
              return array;
          }
  
          public long[] nextLongArray(int n) {
              long[] array = new long[n];
              for (int i = 0; i < n; ++i) array[i] = nextLong();
              return array;
          }
  
          public long[] nextSumLongArray(int n) {
              long[] array = new long[n];
              array[0] = nextInt();
              for (int i = 1; i < n; ++i) array[i] = array[i - 1] + nextInt();
              return array;
          }
  
          public long[] nextSortedLongArray(int n) {
              long array[] = nextLongArray(n);
              Arrays.sort(array);
              return array;
          }
      }
  
  
  }
  