def solve():
    A,B = map(int,input().split())
    bit = 0
    for i in range(60, -1, -1):
        if (A >> i) & 1 != (B >> i) & 1:
            bit = i
            break
    res = []
    for i in range(bit):
        if (A >> i) & 1 == 0:
            res.append(1 << i)
            A |= (1 << i)
    res.append(1)
    A += 1
    for i in range(bit, -1, -1):
        if (A >> i) & 1 != (B >> i) & 1:
            res.append(1 << i)
            A |= (1 << i)
    assert A == B and len(res) <= 120
    print(len(res))
    print(*res)
    return 0


def main():
    t = int(input())
    for i in range(t):
        solve()
    return 0

main()