Two Step Test

Alice and Bob are two separate executions of the same submitted program.

In the first execution, the program plays Alice. Alice receives two integers $A$ and $B$, and must print one integer $x$.

In the second execution, the program plays Bob. Bob receives only Alice's printed value $x$, and must recover the original $A$ and $B$.

The two executions run as fresh independent processes. Memory, global variables, files, and process state from the first execution are not carried to the second execution. The only information passed to the second execution is Alice's integer $x$.

For each test case, the submitted program is executed at most twice.

The input for Alice's execution has the following format.

ALICE
A B

The input for Bob's execution has the following format.

BOB
x

In Alice's execution, print one integer $x$ such that $0 \le x \le 99$.

In Bob's execution, print the original two integers $A$ and $B$, separated by a space.

If Alice's output is not an integer, does not satisfy $0 \le x \le 99$, or contains extra tokens, the submission is wrong. If Bob's output is not the original $A$, $B$, the submission is wrong.

• $0 \le A \le 9$
• $0 \le B \le 9$
• $0 \le x \le 99$