Лето 6

Let's consider the 32 bit representation of all integers `i` from `m` up to `n` inclusive (`m\ ≤\ i\ ≤\ n`; `m*n\ ≥\ 0`, `-2^31\ ≤\ m\ <\ n\ ≤\ 2^31-1`). Note that a negative number is represented in 32 bit Additional Code.

That is the 32 bit sequence, the binary sum of which and the 32 bit representation of the corresponding positive number is `2^32`. For example, the 32 bit representation of 6 is `0000\ 0000\ 0000\ 0000\ 0000\ 0000\ 0000\ 0110` and the 32 bit representation of –6 is `1111\ 1111\ 1111\ 1111\ 1111\ 1111\ 1111\ 1010`.

Let's sort the 32 bit representations of these numbers in increasing order of the number of bit 1. If two representations have the same numbers of bit 1, they are sorted in lexicographical order.

For example, with `m\ =\ 0` and `n\ =\ 5`, the result of the sorting will be

Given `m`, `n` and `k` (`1\ ≤\ k\ ≤\ min(n-m+1,\ 2\ 147\ 473\ 547)`), your task is to write a program to find a number corresponding to `k`-th representation in the sorted sequence.

The only line contains 3 integers `m`, `n` and `k`.

Write the `k`-th number of the sorted numbers.

0 5 3

2

-5 -2 2

-5