C - XOR LCM

You are given a positive integer $c$ ($1 \le c \le 10^7$). You need to find any two positive integers $a$ and $b$ such that: - $1 \le a, b \le 10^{17}$ - $ (a \oplus c) + (b \oplus c) = \text{lcm}(a, c) + \text{lcm}(b, c)$. Here, $\oplus$ denotes the bitwise XOR operator and $\text{lcm}(x, y)$ denotes the lowest common multiple of $x$ and $y$. It can be proven that it is always possible to fin