using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static long[] NList => ReadLine().Split().Select(long.Parse).ToArray(); public static void Main() { Solve(); } static void Solve() { var t = NN; var ans = new string[t * 2]; for (var u = 0; u < t; ++u) { var c = NList; var (a, b) = (c[0], c[1]); var list = Add(a, b); ans[u * 2] = list.Count.ToString(); ans[u * 2 + 1] = string.Join(" ", list); } WriteLine(string.Join("\n", ans)); } static List Add(long a, long b) { var al = Divide(a); var bl = Divide(b); var bpos = 0; var list = new List(); if (al.Count < bl.Count) { bpos = bl.Count - 1; } else { for (var i = al.Count - 1; i >= 0; --i) { if (al[i] == 0 && bl[i] == 1) { bpos = i; break; } } } for (var i = 0; i < bpos; ++i) { if (al[i] == 1) { var tpos = i; list.Add(1L << i); while (true) { al[tpos] = 0; ++tpos; if (al.Count == tpos) { al.Add(1); break; } if (al[tpos] == 0) { al[tpos] = 1; break; } } } } for (var i = bpos; i >= 0; --i) { if (al[i] == 0 && bl[i] == 1) { list.Add(1L << i); } } return list; } static List Divide(long a) { var ans = new List(); while (a > 0) { ans.Add(a % 2); a >>= 1; } return ans; } }