Simple XOR

You are given two integers $L$ and $R\: (L+3\leq R)$. Output any **four distinct** integers between $L$ and $R$ (inclusive) such that their [**bitwise `XOR`**](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) is zero. More formally, output any **four** integers $a_1, a_2, a_3, a_4$ such that: - $a_1\oplus a_2\oplus a_3\oplus a_4 = 0$ - $L\leq a_1, a_2, a_3, a_4\leq R$ - $a_i=a_j$ if and only