def solve(A, B):
    res = []
    i = 63
    while (A >> i) & 1 == (B >> i) & 1:
        if (A >> i) & 1:
            A -= (1 << i)
            B -= (1 << i)
        i -= 1
    assert A.bit_length() < B.bit_length()
    for i in range(B.bit_length() - 1):
        if (A >> i) & 1:
            A += (1 << i)
            res.append(1 << i)
    for i in range(B.bit_length() - 2, -1, -1):
        if (B >> i) & 1:
            A += (1 << i)
            res.append(1 << i)
    return res


T = int(input())
for _ in range(T):
    X = solve(*map(int, input().split()))
    print(len(X))
    print(X)