Hate Coprime

Two integers $x$ and $y$ are given, with $2\leq x,y\leq 10^9$. Using the following operation at most twice, make $x$ and $y$ equal.

• Choose an integer $z$ with $1\leq z\leq 10^{18}$ that is not coprime to $x$. Add $z$ to $x$, or subtract $z$ from $x$.

After each operation, $x$ must still be an integer with $1\leq x\leq 10^{18}$.

It can be proven that $x$ can always be turned into $y$ with at most two operations.

The first line contains the integer $M$, the number of operations used $(0\leq M \leq 2)$.

From the second line onward, print the operations in order, one per line.

• If the operation adds $z$ to $x$, print $z$.
• If the operation subtracts $z$ from $x$, print $-z$.