#P2094. Xor Transform

Xor Transform

题目描述

点击这里查看pdf

MianKing has one integer XX, he wants to perform some operations to transform XX to YY (YltX)(Y \\lt X).

In each operation, MianKing can choose one integer

It's noticed that after an operation, the upper bound of AA will change because XX has changed.

Now you need to help MianKing to find a way to transform XX to YY by doing at most 55 operations.

输入格式

The first line has two integers X,YX,Y.

1leqYltXleq10181\\leq Y \\lt X\\leq 10^{18}.

输出格式

The first line has one integer dd denotes the number of operations you did.

Then there are dd integers A1...dA_{1...d} denotes the AA you choose in each operations.

0leqdleq50\\leq d\\leq 5.

样例

5 3 

3 
1 2 5

提示

Form ICPC2020济南站