时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld
题目描述
MianKing has one integer 
, he wants to perform some operations to transform to 
)
.
In each operation, MianKing can choose one integer
and let 
.
It's noticed that after an operation, the upper bound of
will change because has changed.
Now you need to help MianKing to find a way to transform to by doing at most 
operations.
In each operation, MianKing can choose one integer
It's noticed that after an operation, the upper bound of
Now you need to help MianKing to find a way to transform
输入描述:
The first line has two integers.
.
输出描述:
The first line has one integerdenotes the number of operations you did.
Then there aredenotes the
.