The group stage of the World Cup has ended, the teams are ready for the knockout
stage, and many experts are trying to figure out the next world champion. One of
them is Boris, the man who correctly determined the last four world champions.
Lower the chances \(of\) this team because they have \(a\) player \(of\) Barcelona, raise the
chances \(of\) that team beacuse they have the captain \(of\) Real Madrid... - Boris is
calucati\(ng - No\)w \(I\) only need \(to\) multiply the integers x and y , and the \(I\) can
announce the next world champion.
The audience suddenly got very quiet. They are impatienly waiting to know if Croatia is going to win.
Boris will multiply \(x\) and \(y\) using his famous method of four registers.
He has four register: A, B, C and D. Initially they have the values: \(x\), \(y\), 0 and 1, respectively. The only
operation he is allowed to do is summing up two registers (possibly the same) and storing the result in
one of the registers. Each of the registers can have the value of at most \(2 \cdot 10^{18}\).
He doesn’t want the audience to wait too long, so he can make at most 100 of such operations.
Help him determine the operations he needs to do, and in which of the registers will the final result be
stored.

Subtask 1 (14 points): x, \(y \le 50\)

Subtask 2 (14 points): \(x \cdot y \le 10^{4}\)

Subtask 3 (42 points): No additional constraints.

The first and only line contains positive integers \(x\) and \(y\) (\(1 \le x \cdot y \le 10^{18}\)), the numbers Boris needs to
multiply.

In the first line output the integer \(n\) (\(0 \le n \le 100\)), the number of operations Boris needs to do.
In the \(i-th\) of the following \(n\) lines output the operation in the format R1 R2 R3, where R_{j} is the label of
the register (A, B, C or D), and the operation means the sum of R1 and R2 will be stored in R3.
If there are multiple correct solutions, output any of them. The solution doesn’t need to have the minimal
number of operations.

생성자가 기록되지 않았습니다.

출처 COCI 2022/2023 Contest 2