from operator import itemgetter
from itertools import *
from bisect import *
from collections import *
from heapq import *
import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.buffer.readline()[:-1]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def solve(a,b):
    ans=[]
    while 1:
        d=a&-a
        if a+d>b:break
        ans.append(d)
        a+=d
        # print(bin(a),bin(b),ans)
    for k in range(60,-1,-1):
        if a>>k&1!=b>>k&1:
            ans.append(1<<k)
            a+=1<<k
            # print(bin(a),bin(b),ans)
    print(len(ans))
    print(*ans)

for _ in range(II()):
    a,b=MI()
    solve(a,b)